ALEX
la_vector
ALEX | la_vector | |
---|---|---|
1 | 1 | |
649 | 35 | |
0.8% | - | |
2.8 | 0.0 | |
about 2 months ago | over 1 year ago | |
C++ | C++ | |
MIT License | 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.
ALEX
-
PGM Indexes: Learned indexes that match B-tree performance with 83x less space
Also, a learned index from Microsoft: https://github.com/microsoft/ALEX
la_vector
-
PGM Indexes: Learned indexes that match B-tree performance with 83x less space
Hi Jouni!
You may find interesting these other papers of ours:
- The ALENEX21 paper "A 'learned' approach to quicken and compress rank/select dictionaries" (http://pages.di.unipi.it/vinciguerra/publication/learned-ran..., https://github.com/gvinciguerra/la_vector), where we introduce a compressed bitvector supporting efficient rank and select queries, which is competitive with several well-established implementations of succinct data structures.
- The ICML20 paper "Why are learned indexes so effective?" (http://pages.di.unipi.it/vinciguerra/publication/learned-ind...) where we prove that, under some general assumptions on the input data, the space of the PGM-index is actually O(n/B^2) whp (versus Θ(n/B) of classic B-trees).
What are some alternatives?
PGM-index - 🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes
RadixSpline - A Single-Pass Learned Index
SOSD - A Benchmark for Learned Indexes