> It would be great if we could overcome this bottleneck as well with the > radix tree approach. Together with [1] and [2] this would further close > the gap compared to plain vanilla index scan. > > [1] > https://www.postgresql.org/message-id/flat/CAPsAnrn5yWsoWs8GhqwbwAJx1SeLxLntV54Biq0Z-J_E86Fnng%40mail.gmail.com > [2] > https://www.postgresql.org/message-id/29f27b97-b3d7-476b-acae-832b3443b0c4%40gmail.com
I missed [3] which is yet another improvement to reduce the overhead of BIS. For overview purposes we have: 1. Parallelizing Bitmap Index Scan and Bitmap And/Or 2. Optimizing the block sort via sort_template.h 3. Improving TID insertion performance by batching 4. Using radix tree instead of simplehash.h in TIDBitmap -- David Geier [3] https://www.postgresql.org/message-id/flat/CAEEBa3U7QDChb%3DPjzQGHoie-tOnfr7dumhO12Tp%3D5o2iT4t_ug%40mail.gmail.com
