pisa VS alexandria

The EF core algorithm implemented in folly [3] may be a bit faster, and implementing partitioning on top of that is relatively easy.

It would definitely compress much better than roaring bitmaps. In terms of performance, it depends on the access patterns. If very sparse (large jumps) PEF would likely be faster, if dense (visit a large fraction of the bitmap) it'd be slower.

It is possible to squeeze a bit more compression out of PEF by introducing a chunk type for Elias-Fano of the chunk complement (for very dense chunks), but you lose the operation of skipping to a given position, which is however not needed in inverted indexes (you only need to skip past a given id, and that can be supported efficiently). That is not mentioned in the paper because at the time I thought the skip-to-position operation was a non-negotiable.

[1] https://github.com/ot/ds2i/

[2] https://github.com/pisa-engine/pisa

[3] https://github.com/facebook/folly/blob/main/folly/experiment...

Some people report not getting results (e.g. for the word "dog"), i do get results, the about page mentions it's in early development, if anybody want to open a bug you can do it here , unless a bug already exist then i think doing a "thumbs up" is enough. (It didn't at the time i wrote this comment),

doesnt work

https://alexandria.org?q=cannot+use+generic+function+without...