Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Consider a dense B+tree index with the search key on Salary for 1,000,000 records stored in 1000 disk pages. The data entries use Alternative (2) format and each data entry has a size equal to 25% of the data record size.  (1) What is the number of pages required for storing all data entries? (2) If the B+tree is unclustered and if 1% of all records satisfy the condition 100K ≤ Salary ≤ 200K, what is the number of I/O pages required to retrieve the satisfying records using the B+tree. You can assume the height of the B-tree is h. (3) Repeat (2) for a clustered B+tree.

Consider a dense B+tree index with the search key on Salary for 1,000,000 records stored in 1000 disk pages. The data entries use Alternative (2) format and each data entry has a size equal to 25% of the data record size.  (1) What is the number of pages required for storing all data entries? (2) If the B+tree is unclustered and if 1% of all records satisfy the condition 100K ≤ Salary ≤ 200K, what is the number of I/O pages required to retrieve the satisfying records using the B+tree. You can assume the height of the B-tree is h. (3) Repeat (2) for a clustered B+tree.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Consider a dense B+tree index with the search key on Salary
for 1,000,000 records stored in 1000 disk pages. The data entries use Alternative (2) format and each data entry has a size equal to 25% of the data record size. 
(1) What is the number of pages required for storing all data entries?
(2) If the B+tree is unclustered and if 1% of all records satisfy the condition 100K ≤ Salary ≤ 200K, what is the number of I/O pages required to retrieve the satisfying records using the B+tree. You can assume the height of the B-tree is h.
(3) Repeat (2) for a clustered B+tree. 

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS