PLW / blink-tree-logicLinks
BLInk Tree logic - storage and locking experiment
☆28Updated 11 years ago
Alternatives and similar repositories for blink-tree-logic
Users that are interested in blink-tree-logic are comparing it to the libraries listed below
Sorting:
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- C++ fast transactional key-value storage.☆172Updated this week
- Log-Structured Merge-Tree (LSM-Tree)☆89Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆82Updated 2 years ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- An embedded key-value store library specialized for building state machine and log store☆236Updated 3 months ago
- Embedded InnoDB based on v5.1☆34Updated last month
- The Cicada engine☆59Updated 8 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- Adaptive Radix Tree in C++☆47Updated this week
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years ago
- A cache-efficiency weight balanced binary tree☆71Updated 11 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- levi-db is a fast database engine☆36Updated 7 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- Yet Another RAFT implementation☆125Updated 7 years ago
- ☆20Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago
- Key Value Store based on LevelDB☆116Updated 4 years ago
- ☆29Updated last month
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆144Updated 3 years ago
- A toy SQL engine built on top of LSM(LevelDB)☆22Updated 6 years ago