We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

B-Tree - explore the heart of PostgreSQL

Formal Metadata

Title
B-Tree - explore the heart of PostgreSQL
Title of Series
Number of Parts
34
Author
License
CC Attribution 3.0 Unported:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
B-tree index is the most common index type. Most if not all of the modern DBMS use it. The data structure and concerned algorithms are really mature, there are about 40 years of development. And PostgreSQL's B-tree is not exception. It's full of complicated optimisations of performance, concurrency and so on. But there're still many ways to improve it. At the conference we'll discuss new features which are already done and ideas for further improvements. Of course it requires deep drive into B-tree internals and I'm going to guide you there.