A simple, reference implementation of a B^e-tree
☆167Mar 25, 2019Updated 7 years ago
Alternatives and similar repositories for Be-Tree
Users that are interested in Be-Tree are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆297Jun 9, 2024Updated 2 years ago
- Open-Channel SSD emulator using memory☆22Nov 1, 2017Updated 8 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆97Nov 14, 2019Updated 6 years ago
- ☆151Mar 11, 2023Updated 3 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Beta release of Masstree.☆459Oct 15, 2023Updated 2 years ago
- ☆129May 25, 2026Updated last month
- ☆31Aug 16, 2019Updated 6 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Mar 12, 2021Updated 5 years ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆24Apr 1, 2021Updated 5 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆25Dec 27, 2019Updated 6 years ago
- The Cicada engine☆59Jun 16, 2017Updated 9 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆169Oct 4, 2021Updated 4 years ago
- End-to-end encrypted cloud storage - Proton Drive • AdSpecial offer: 40% Off Yearly / 80% Off First Month. Protect your most important files, photos, and documents from prying eyes.
- LSM-trie☆114Mar 22, 2021Updated 5 years ago
- Benchmarking framework for index structures on persistent memory☆90Jun 17, 2026Updated last month
- qp tries and crit-bit tries☆124Jul 12, 2022Updated 4 years ago
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆24Mar 17, 2025Updated last year
- Adaptive Radix Tree in C++☆53Jul 1, 2026Updated 2 weeks ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- Dependably fast multi-core in-memory transactions☆21Aug 10, 2017Updated 8 years ago
- An open-source BzTree implementation☆91Aug 3, 2021Updated 4 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 7 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Parallel Balanced Binary Tree Structures☆122Mar 15, 2025Updated last year
- Bε tree implementation☆14Dec 6, 2023Updated 2 years ago
- ☆14Oct 5, 2015Updated 10 years ago
- HOT - Height Optimized Trie☆158Mar 26, 2018Updated 8 years ago
- Source code for our OSDI 2016 paper☆110Nov 11, 2018Updated 7 years ago
- ☆25Aug 1, 2016Updated 9 years ago
- Self-Tuning Adaptive Radix Tree☆32Apr 19, 2020Updated 6 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12May 7, 2016Updated 10 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆213Aug 2, 2023Updated 2 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Sparc emulator☆11May 19, 2018Updated 8 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Mar 30, 2023Updated 3 years ago
- Understanding the Idiosyncrasies of Real Persistent Memory☆33Aug 18, 2021Updated 4 years ago
- ☆100Nov 19, 2020Updated 5 years ago
- KVell: the Design and Implementation of a Fast Persistent Key-Value Store☆294Dec 15, 2025Updated 7 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆36Jun 8, 2016Updated 10 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆86Apr 29, 2022Updated 4 years ago