Traditional database indexes have a tree structure on disk (called a B-tree) that has a key value, which allows the database engine to quickly retrieve the row needed using a key.

Database administrators will notice potentially significant query execution gains with PostgreSQL 17. The gains will be noticeable for queries that use the ‘IN’ clause with a B-tree index ...