A simple, reference implementation of a B^e-tree
☆170Mar 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:
- ☆302Jun 9, 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
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆97Nov 14, 2019Updated 6 years ago
- ☆129May 25, 2026Updated 5 months ago
- WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems (FAST 2017)☆24Apr 1, 2021Updated 5 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.
- ☆153Mar 11, 2023Updated 3 years ago
- ☆16Feb 19, 2017Updated 9 years ago
- Open-Channel SSD emulator using memory☆23Nov 1, 2017Updated 8 years ago
- ☆31Aug 16, 2019Updated 7 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 7 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆118Mar 12, 2021Updated 5 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- LSM-trie☆114Mar 22, 2021Updated 5 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆170Oct 4, 2021Updated 5 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.
- Beta release of Masstree.☆458Oct 15, 2023Updated 3 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆95Dec 11, 2022Updated 3 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆121Mar 15, 2025Updated last year
- Protocol-Aware Correlated Crash Explorer for Distributed Storage Systems☆16Nov 14, 2016Updated 9 years ago
- ☆101Nov 19, 2020Updated 5 years ago
- ☆11Sep 15, 2024Updated 2 years ago
- An open-source BzTree implementation☆93Aug 3, 2021Updated 5 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- ☆30Sep 14, 2022Updated 4 years ago
- Adaptive Radix Tree in C++☆54Oct 7, 2026Updated 3 weeks ago
- Fast Approximate Membership Filters (C++)☆286Sep 21, 2026Updated last month
- Benchmarking framework for index structures on persistent memory☆93Aug 10, 2026Updated 2 months ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Apr 5, 2023Updated 3 years ago
- A Fast, Cost-Effective LSM-tree Based KV Store on Hybrid Storage☆214Aug 2, 2023Updated 3 years ago
- The Cicada engine☆60Jun 16, 2017Updated 9 years ago
- HOT - Height Optimized Trie☆159Mar 26, 2018Updated 8 years ago
- PerconaFT is a high-performance, transactional key-value store☆560Mar 29, 2024Updated 2 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.
- qp tries and crit-bit tries☆123Jul 12, 2022Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆24Sep 16, 2022Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆37Jun 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)☆89Oct 11, 2026Updated 2 weeks ago
- ☆10Jan 9, 2025Updated last year
- Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)☆49Mar 18, 2021Updated 5 years ago
- Code for "Building an Efficient Key-Value Store in a Flexible Address Space" (EuroSys '22)☆23Mar 17, 2025Updated last year