Download slides

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 an exception. It's full of complicated optimizations of performance, concurrency and so on. But there're still many ways to improve it.

This talk gives you a deep dive into B-tree indexes. It covers several recent features of PostgreSQL B-tree which are already released as well as the upcoming improvements. It demonstrates use cases and shows the limitations to help you use indexes in the most efficient way.