pisa
ds2i
| pisa | ds2i | |
|---|---|---|
| 1 | 1 | |
| 859 | 141 | |
| 1.5% | - | |
| 8.0 | 0.0 | |
| 16 days ago | over 1 year ago | |
| C++ | C++ | |
| Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
pisa
-
A Compressed Indexable Bitset
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...
ds2i
-
A Compressed Indexable Bitset
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...
What are some alternatives?
lucene - Apache Lucene open-source search software
efg - GPU based Compressed Graph Traversal
Apache Solr - Apache Lucene and Solr open-source search software
Folly - An open-source C++ library developed and used at Facebook.
resin - Vector space search engine. Available as a HTTP service or as an embedded library.
tantivy - Tantivy is a full-text search engine library inspired by Apache Lucene and written in Rust
MeTA - A Modern C++ Data Sciences Toolkit
Typesense - Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences
alexandria - Full text search engine powering Alexandria.org - the open search engine.
RediSearch - A query and indexing engine for Redis, providing secondary indexing, full-text search, vector similarity search and aggregations.