A simple, reference implementation of a B^e-tree
☆164Mar 25, 2019Updated 6 years ago
Alternatives and similar repositories for Be-Tree
Users that are interested in Be-Tree are comparing it to the libraries listed below
Sorting:
- ☆296Jun 9, 2024Updated last year
- ☆12Dec 18, 2018Updated 7 years ago
- ☆30Aug 16, 2019Updated 6 years ago
- Adaptive Radix Tree in C++☆51Updated this week
- Beta release of Masstree.☆457Oct 15, 2023Updated 2 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Nov 14, 2019Updated 6 years ago
- LSM-trie☆115Mar 22, 2021Updated 4 years ago
- Open-Channel SSD emulator using memory☆21Nov 1, 2017Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- The Cicada engine☆59Jun 16, 2017Updated 8 years ago
- Bε tree implementation☆12Dec 6, 2023Updated 2 years ago
- Sparc emulator☆11May 19, 2018Updated 7 years ago
- Parallel Balanced Binary Tree Structures☆122Mar 15, 2025Updated 11 months ago
- Dependably fast multi-core in-memory transactions☆21Aug 10, 2017Updated 8 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 4 years ago
- 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
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 3 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Mar 17, 2025Updated 11 months ago
- Read- and latency-optimized log structured merge tree☆175Apr 2, 2012Updated 13 years ago
- An open-source BzTree implementation☆92Aug 3, 2021Updated 4 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Jun 7, 2023Updated 2 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆26Dec 27, 2019Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12May 7, 2016Updated 9 years ago
- PerconaFT is a high-performance, transactional key-value store☆561Mar 29, 2024Updated last year
- Benchmarking framework for index structures on persistent memory☆89Jul 12, 2023Updated 2 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 7 years ago
- Fast Approximate Membership Filters (C++)☆289Aug 29, 2025Updated 6 months ago
- Source code for our OSDI 2016 paper☆110Nov 11, 2018Updated 7 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated last year
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- ☆14Oct 5, 2015Updated 10 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
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Oct 4, 2021Updated 4 years ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆24Apr 1, 2021Updated 4 years ago
- ☆39Jun 20, 2020Updated 5 years ago
- Protocol-Aware Correlated Crash Explorer for Distributed Storage Systems☆15Nov 14, 2016Updated 9 years ago