Summary
Chapter 1 · pages 36–38 · 557 words
This closing section recaps the ground covered by Chapter 1 and points toward the next chapter's topic. It does not introduce new technical mechanisms; instead it consolidates the chapter's storyline into a few takeaways and gives pointers for further reading, plus a preview of Chapter 2.
The chapter's arc, as summarized here, moved from memory- versus disk-based stores (disk-based structures matter for both types, just for different purposes) to column- versus row-oriented DBMS (access patterns shape design), to the basics of data files and index files (how data is physically stored), and finally to three recurring themes—buffering, immutability, and ordering—that the book will keep returning to when discussing storage engines.
The Further Reading list points to sources on database architecture (Hellerstein, Stonebraker, and Hamilton), column-oriented systems (Abadi et al.), and in-memory database systems (Faerber, Kemper, and Alfons), for readers who want to go deeper into any of these three strands.
The section then bridges into Chapter 2 on B-Trees, previewing that storage structures split into mutable and immutable groups, that mutable structures typically use in-place updates, and that storage engines can keep multiple versions of the same record (via multiversion concurrency control or slotted page organization). It notes that B-Trees, invented by Rudolph Bayer and Edward M. McCreight in 1971, are one of the most popular storage structures, underlying many open source databases, and that by 1979 Douglas Comer had already catalogued many B-Tree variants.
flowchart LR
A[Memory vs Disk stores] --> B[Row vs Column orientation]
B --> C[Data files and Index files]
C --> D[Buffering, Immutability, Ordering]
D --> E[Chapter 2: B-Trees]
Exhibits and original pages (2)
