Question 47
Consider a database implemented using a B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of the search key is 12 bytes and the size of a tree/disk pointer is 8 bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ______.
Sign in to see the answer
Answers and explanations are free — they just need an account.