Storage for Database Management Systemss
Database storage is how a DBMS lays out data on disk and moves it through memory. Tables are split into fixed-size pages organised as heap files, with slotted pages holding variable-length tuples. A buffer pool caches pages and uses replacement policies, so the system can work with data larger than RAM.
Stage: Storage and Indexes · Part of the Database Management Systems roadmap · Last reviewed 19 November 2026
What to learn in Storage
- Describe the slotted page layout and how tuple offsets are tracked
- Compare row-oriented and column-oriented storage and their use cases
- Explain how the buffer pool maps page ids to frames
- Implement an LRU-K or clock replacement policy for evicting pages
- Account for pinning and dirty pages when evicting
- Explain why databases manage their own buffer pool rather than using the OS page cache
Storage interview questions
What is a slotted page?
A slotted page stores a header and an array of slot entries pointing to tuples, with tuples packed from the end of the page. This allows variable-length records, lets tuples move within a page without changing their record id, and makes deletion easy to handle.
Why do databases avoid relying on the OS page cache?
The DBMS knows its access patterns, such as sequential scans, and which dirty pages must reach disk before the log is flushed. Managing its own buffer pool gives control over eviction, prefetching and write ordering, which the operating system cannot know.
Where Storage fits in the Database Management Systems roadmap
Storage belongs to the Storage and Indexes stage (advanced level). How data lives on disk.
Other units in this stage
Back to the full Database Management Systems roadmap