la_vector
PGM-index
Our great sponsors
| la_vector | PGM-index | |
|---|---|---|
| 1 | 6 | |
| 35 | 758 | |
| - | - | |
| 0.0 | 6.2 | |
| over 1 year ago | 6 days ago | |
| C++ | C++ | |
| Apache License 2.0 | 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.
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).
PGM-index
-
Self-indexing RDBMS? Could AI help?
PGM Index
- Piecewise Geometric Model Index
-
Manticore Search 5
Manticore Columnar Library uses Piecewise Geometric Model index, which exploits a learned mapping between the indexed keys and their location in memory. The succinctness of this mapping, coupled with a peculiar recursive construction algorithm, makes the PGM-index a data structure that dominates traditional indexes by orders of magnitude in space while still offering the best query and update time performance.
-
PGM Indexes: Learned indexes that match B-tree performance with 83x less space
Yep, I'm working on a multidimensional version that I hope to upload to the main repo (https://github.com/gvinciguerra/PGM-index) in a few weeks.
What are some alternatives?
RadixSpline - A Single-Pass Learned Index
ALEX - A library for building an in-memory, Adaptive Learned indEX
manticoresearch - Easy to use open source fast database for search | Good alternative to Elasticsearch now | Drop-in replacement for E in the ELK soon
SOSD - A Benchmark for Learned Indexes
robin-map - C++ implementation of a fast hash map and hash set using robin hood hashing
sdsl-lite - Succinct Data Structure Library 3.0
bolt - 10x faster matrix and vector operations
Huffman-Coding - A C++ compression program based on Huffman's lossless compression algorithm and decoder.
kudu - Mirror of Apache Kudu