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 ________.
GATE CS 2020 (Forenoon) — Question 64
Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)NAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on File Organization & Indexing (e.g., B and B+ Trees)
- GATE CS 2026 (Afternoon) · Q46An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a s…
- GATE CS 2025 (Forenoon) · Q21Consider the following B + tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the B + tree.…
- GATE CS 2025 (Afternoon) · Q57In a B+ - tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: A = (49, 77, 83, –),…
- GATE CS 2024 (Forenoon) · Q21In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
- GATE CS 2024 (Afternoon) · Q26Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?
- GATE CS 2023 (Forenoon) · Q62Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes,…

