Question 21
In B+ Trees, where are the actual data pointers or record pointers stored?
In a B+ Tree, internal nodes contain only search key values for routing, while all actual data/record pointers reside exclusively in leaf nodes.
In B+ Trees, where are the actual data pointers or record pointers stored?
In a B+ Tree, internal nodes contain only search key values for routing, while all actual data/record pointers reside exclusively in leaf nodes.
What is the primary advantage of a B+ Tree over a standard B-Tree?
Leaf nodes in a B+ Tree form a doubly linked list, enabling fast sequential range scans without traversing parent nodes repeatedly.
Which logging technique writes log records to stable storage before the corresponding data is written to disk?
WAL protocol requires log records describing modifications to be flushed to persistent storage before the modified data pages are written to disk.
In database recovery, what does the REDO operation do?
REDO reads log records of committed transactions and re-executes their updates to guarantee Durability following a crash.
What does the UNDO operation in database crash recovery perform?
UNDO restores the database state by removing modifications performed by transactions that failed or were active (uncommitted) at the time of crash.