gvinciguerra/PGM-index
View on GitHub ↗ ★ 880 C++
🏅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
4 mentions on Hacker News by 1 person: 0 stories, 4 comments · first 2021-01-25 · latest 2021-01-25
20082026
-
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.
comment by gvinciguerra · 2021-01-25 · in PGM Indexes: Learned indexes that match B-tree performance with 83x less space -
…a prefix of P chars with the given query string. I discussed this solution in a GitHub issue ( https://github.com/gvinciguerra/PGM-index/issues/8#issuecomm... ). It may work in practice, but it's far from being adequate if compared to trie…
comment by gvinciguerra · 2021-01-25 · in PGM Indexes: Learned indexes that match B-tree performance with 83x less space -
…Section 3 "Dynamic PGM-index" and experimented in Section 7.3. The implementation is available at https://github.com/gvinciguerra/PGM-index/blob/master/includ... and the documentation at https://pgm.di.unipi.it/docs/cpp-reference/#classpgm_…
comment by gvinciguerra · 2021-01-25 · in PGM Indexes: Learned indexes that match B-tree performance with 83x less space -
…in Section 7.3. The Dynamic PGM-index is open-source too: you can find the implementation at https://github.com/gvinciguerra/PGM-index/blob/master/includ... and the documentation at https://pgm.di.unipi.it/docs/cpp-reference/#classpgm_1_1_d…
comment by gvinciguerra · 2021-01-25 · in PGM Indexes: Learned indexes that match B-tree performance with 83x less space