Room: Medici I
When considering database indexing, most people think of the trade-offs of different data structures, like btree and hash. However, with Postgres, there are a wide variety of indexing structures available, and many index lookup methods with specialized capabilities. For example, GiST allows for efficient retrieval of the closest matches for unordered data, like two-dimensional points or phonetic algorithms. Gin indexing specializes in rapid lookup of keys with potentially many matches — an area where traditional btree indexes perform poorly. Gin index compression and multi-key lookup optimizations make gin even more powerful. Jsonb indexing improvements also give Postgres new power to rapidly access unstructured data.