B-tree indexes - learn more about the heart of PostgreSQL
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. And PostgreSQL's B-tree is not an exception. It's full of complicated optimizations of performance, concurrency and so on. Still, there are many ways to improve it.
This talk gives you a deep dive into B-tree indexes architecture and covers the newest major features of PostgreSQL B-tree:
- INCLUDING clause for B-tree indexes;
- B-tree deduplication;
- amcheck module.
Feature by feature we will discuss use cases and limitations to help you use indexes the most efficiently.