Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of 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 ___________ .
Note – This question was Numerical Type.
Quiz of this Question
Please comment below if you find anything wrong in the above post