edited by
190 views
0 votes
0 votes

Consider that blocks can hold either ten records or 99 keys and 100 pointers. Assume that the average B+ tree node is oncost 70% full, i.e. except root it will have 69 keys and 70 pointers. The total number of blocks needed for a 10000. record file, if memory initially is empty, the search key is the primary key for the records and the data file is a sequential file, sorted on the search key, with 10 records per block with dense index are ______.

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
Vipin Rai asked Jan 10, 2019
262 views
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
4