GATEverse Practice, past papers & mock tests
GATE 2020
Database ManagementIndexinghardNAT2 marks
Consider a database implemented using B+ tree for file indexing on disk with block size 4 KB. Search key is 12 bytes and tree/disk pointer is 8 bytes. The database has 1 million records. Each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is _______
Save your progress

Related Database Management PYQs