The order of a leaf node in a B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given a block size of 1K bytes, a 7-byte data record pointer, a 9-byte value field and a 6-byte block pointer, what is the order of the leaf node?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 63
Explanation
A leaf holds p pairs plus one next-leaf block pointer: 16p + 6 ≤ 1024, so p = 63.
More Database Management Systems questions
- Which of the DBMS component ensures that concurrent execution of multiple operations on the database results into a consistent database sta…
- Consider following two statements: Statement I: Relational database schema represents the logical design of the database. Statement II: Cur…
- Given a fixed‐length record file that is ordered B on the key field. The file needs disk blocks to R store number of records. Find the aver…
- Given the following STUDENT‐COURSE scheme: STUDENT (Rollno, Name, courseno) COURSE (courseno, coursename, capacity), where Rollno is the pr…
- Given STUDENT(Rollno, Name, Courseno) and COURSE(Courseno, Coursename, Capacity) with 5 and 3 records, R = STUDENT × COURSE is computed. Ma…
- A B tree indexes a database file with search key 10 bytes, block 1024 bytes, record pointer 9 bytes and block pointer 8 bytes. If K is the…