gvinciguerra / PGM-indexView external linksLinks
🏅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
☆865Nov 28, 2024Updated last year
Alternatives and similar repositories for PGM-index
Users that are interested in PGM-index are comparing it to the libraries listed below
Sorting:
- A Benchmark for Learned Indexes☆301Apr 27, 2022Updated 3 years ago
- The recursive model index, a learned index structure☆230Oct 15, 2025Updated 4 months ago
- A library for building an in-memory, Adaptive Learned indEX☆698Mar 12, 2024Updated last year
- A Single-Pass Learned Index☆137Apr 28, 2023Updated 2 years ago
- Updatable Learned Index with Precise Positions☆62Feb 7, 2022Updated 4 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Nov 9, 2022Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆22Nov 1, 2023Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- High Performance Learned Index on Persistent Memory☆49Apr 19, 2023Updated 2 years ago
- 🐍 Python library implementing sorted containers with state-of-the-art query performance and compressed memory usage☆215Apr 2, 2024Updated last year
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆37Apr 14, 2022Updated 3 years ago
- A persistent learned index for non-volatile memory with high read/write performance.☆21Jun 16, 2022Updated 3 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21May 9, 2021Updated 4 years ago
- a fully learned index for larger-than-memory databases☆15Sep 17, 2022Updated 3 years ago
- ☆14Apr 8, 2023Updated 2 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Dec 19, 2018Updated 7 years ago
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆150Dec 20, 2018Updated 7 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Jan 8, 2018Updated 8 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- ☆28Oct 14, 2022Updated 3 years ago
- [SIGMOD’24] Source code for the paper: Making In-Memory Learned Indexes Efficient on Disk☆12Jun 28, 2024Updated last year
- ☆43May 22, 2021Updated 4 years ago
- ☆57May 14, 2024Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- Learned Sort: a model-enhanced sorting algorithm☆81Aug 20, 2021Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- A read-optimized learned index for unsorted data☆32Aug 10, 2023Updated 2 years ago
- A set of learned index papers w/o notes☆17Apr 25, 2024Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Dec 2, 2021Updated 4 years ago
- A Distribution-driven Learned Index☆16May 18, 2023Updated 2 years ago
- A learned index structure☆53Jan 5, 2021Updated 5 years ago
- ☆48Jun 10, 2023Updated 2 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆13Nov 21, 2021Updated 4 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆449Jan 10, 2025Updated last year
- A Recursive Spatial Model Index☆40Mar 18, 2024Updated last year
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 10 months ago
- Succinct Data Structure Library 2.0☆2,294Jun 2, 2023Updated 2 years ago
- Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20☆1,603May 1, 2023Updated 2 years ago