Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
☆85Apr 29, 2022Updated 3 years ago
Alternatives and similar repositories for wormhole
Users that are interested in wormhole are comparing it to the libraries listed below
Sorting:
- ☆30Sep 14, 2022Updated 3 years ago
- ☆57May 14, 2024Updated last year
- ☆126Apr 8, 2022Updated 3 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- ☆50Aug 20, 2020Updated 5 years ago
- A read-optimized learned index for unsorted data☆32Aug 10, 2023Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Sep 18, 2018Updated 7 years ago
- Adaptive Radix Tree in C++☆51Feb 25, 2026Updated last week
- ☆15Mar 31, 2022Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆22Nov 1, 2023Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Mar 30, 2023Updated 2 years ago
- LB+-Tree implementation☆49Apr 4, 2021Updated 4 years ago
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆54Nov 9, 2022Updated 3 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆22Apr 16, 2025Updated 10 months ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆21Nov 15, 2022Updated 3 years ago
- Updatable Learned Index with Precise Positions☆62Feb 7, 2022Updated 4 years ago
- An open-source BzTree implementation☆92Aug 3, 2021Updated 4 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- High Performance Learned Index on Persistent Memory☆49Apr 19, 2023Updated 2 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- The Cicada engine☆59Jun 16, 2017Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Jan 14, 2019Updated 7 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- QSBR and EBR library☆134Dec 15, 2019Updated 6 years ago
- Adaptive Radix Trees implemented in C☆817Mar 21, 2022Updated 3 years ago
- ☆16Jan 24, 2025Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆172Nov 24, 2025Updated 3 months ago
- A Benchmark for Learned Indexes☆301Apr 27, 2022Updated 3 years ago
- Scalable Hashing on Persistent Memory☆195Apr 16, 2024Updated last year
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- The recursive model index, a learned index structure☆229Oct 15, 2025Updated 4 months ago
- the fastest in-memory index in the East 东半球最快并发索引☆476Feb 4, 2021Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆526Nov 14, 2018Updated 7 years ago