alexandria
pisa
alexandria | pisa | |
---|---|---|
4 | 1 | |
181 | 868 | |
0.0% | 2.5% | |
0.0 | 8.0 | |
3 months ago | 8 days ago | |
C++ | C++ | |
GNU General Public License v3.0 or later | Apache License 2.0 |
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.
alexandria
-
Alexandria Search is a open source ad free nonprofit web search engine
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),
-
Alexandria Search
doesnt work
https://alexandria.org?q=cannot+use+generic+function+without...
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...
What are some alternatives?
zotero-scihub - A plugin that will automatically download PDFs of zotero items from sci-hub
lucene - Apache Lucene open-source search software
RoaringBitmap - A better compressed bitset in Java: used by Apache Spark, Netflix Atlas, Apache Pinot, Tablesaw, and many others
Apache Solr - Apache Lucene and Solr open-source search software
DawnlightSearch - A Linux version of Everything Search Engine.
resin - Vector space index based search engine that's available as a HTTP service or as an embedded library.
MeTA - A Modern C++ Data Sciences Toolkit
efg - GPU based Compressed Graph Traversal
Elasticsearch - Free and Open, Distributed, RESTful Search Engine
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