On Tue, Jun 7, 2022 at 5:00 PM Chinmay Kanchi wrote:
> I personally don't think this is a great replacement for a BTree index - for
> one thing, it isn't really possible to use this approach beyond equality
> comparisons (for scalars) or "contains"-type operations for arrays (or
> tsvectors, js
I personally don't think this is a great replacement for a BTree index -
for one thing, it isn't really possible to use this approach beyond
equality comparisons (for scalars) or "contains"-type operations for arrays
(or tsvectors, jsonb, etc). I see this more as "competing" with GIN, though
I thin
On Mon, Jun 6, 2022 at 10:42 PM Chinmay Kanchi wrote:
> The simulated index in this case is outrageously fast, up to ~150x on the
> GROUP BY.
Couldn't you make a similar argument in favor of adding a B-Tree index
on "country"? This probably won't be effective in practice, but the
reasons for thi
I've been doing some preliminary prep work to see how an inverted index
using roaring bitmaps (https://roaringbitmap.org/) would perform. I'm
presenting some early work using SQL code with the roaring bitmap Postgres
extension (https://github.com/ChenHuajun/pg_roaringbitmap) to
