DBMS · Question 11 · Medium
In a B+ tree index, where are the pointers to actual data records stored?
- Only in the internal nodes
- In both internal and leaf nodes
- Only in the leaf nodes, which are linked to each other for range scans
- Only in the root node
Answer and explanation
Answer: C. Only in the leaf nodes, which are linked to each other for range scans
Explanation: Internal nodes of a B+ tree hold only keys for navigation. All record pointers sit in the leaf level, and the leaves are chained together, which makes range queries efficient.
Previous: Which rule does Write-Ahead Logging (WAL) enforce? · Next: Relation R(A, B, C, D) has exactly one candidate key, A. How many superkeys…
Practise dbms
Try a fresh set of dbms questions with an explanation after every answer, free and without signing up: DBMS practice. Or sit a full placement mock test.
More dbms questions
- Transaction T1 reads a row, then transaction T2 updates that row and commits…
- What does the basic Two-Phase Locking (2PL) protocol guarantee?
- Which rule does Write-Ahead Logging (WAL) enforce?
- Relation R(A, B, C, D) has exactly one candidate key, A. How many superkeys…
- Relation R(A, B, C) has the single functional dependency B → C. It is…
- Consider the schedule S: r1(X), w2(X), w1(X), where ri and wi are read and…
- Relation R(A, B, C) has the functional dependencies AB → C and C → B. Which is…
- A column in the Enrollment table that refers to the primary key of the Student…
- Which ACID property guarantees that once a transaction has committed, its…
- In a relational database, what is a view?
More technical & programming practice
SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics · Pseudo-code · C Programming
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge