rafaelkallis / adaptive-radix-treeView external linksLinks
An adaptive radix tree for efficient indexing in main memory.
☆170Nov 24, 2025Updated 2 months ago
Alternatives and similar repositories for adaptive-radix-tree
Users that are interested in adaptive-radix-tree are comparing it to the libraries listed below
Sorting:
- Adaptive Radix Trees implemented in C☆819Mar 21, 2022Updated 3 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- An open sourced implementation of Bw-Tree in SQL Server Hekaton☆526Nov 14, 2018Updated 7 years ago
- ☆125Apr 8, 2022Updated 3 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- TLX - A Collection of Sophisticated C++ Data Structures, Algorithms, and Miscellaneous Helpers☆448Jan 10, 2025Updated last year
- 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
- ☆607Jan 15, 2026Updated last month
- ☆15Feb 19, 2017Updated 8 years ago
- Adaptive Radix Tree in C++☆50Updated this week
- the fastest in-memory index in the East 东半球最快并发索引☆478Feb 4, 2021Updated 5 years ago
- 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
- Implementation of the BwTree as specified by Microsoft Research☆101Apr 4, 2016Updated 9 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Aug 20, 2021Updated 4 years ago
- Concurrent ART (adaptive radix tree)☆178Sep 26, 2025Updated 4 months ago
- An open-source BzTree implementation☆92Aug 3, 2021Updated 4 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Sep 18, 2018Updated 7 years ago
- ☆30Nov 8, 2021Updated 4 years ago
- C++ fast transactional key-value storage.☆176Updated this week
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆168Apr 7, 2021Updated 4 years ago
- A fast and space efficient Radix tree in Java☆132Mar 31, 2020Updated 5 years ago
- Fast Static Symbol Table (FSST): efficient random-access string compression☆497Nov 26, 2025Updated 2 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
- Sequential implementation of the Rewired Memory Array.☆19May 23, 2019Updated 6 years ago
- ☆290Dec 28, 2022Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆196Oct 15, 2024Updated last year
- C++ bindings & containers for libpmemobj☆110Mar 22, 2023Updated 2 years ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Persistent Adaptive Radix Tree (PART) for JavaScript☆13Jan 19, 2018Updated 8 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆127Oct 10, 2024Updated last year
- BI benchmark with user generated data and queries☆73Dec 19, 2024Updated last year
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆163Mar 25, 2019Updated 6 years ago
- A high-performance, concurrent hash table☆1,732Mar 31, 2025Updated 10 months ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago