PLW / blink-tree-logic
BLInk Tree logic - storage and locking experiment
☆25Updated 10 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
- Adaptive Radix Tree in C++☆41Updated last week
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- The Cicada engine☆55Updated 7 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- A toy SQL engine built on top of LSM(LevelDB)☆22Updated 5 years ago
- C implementation of the Raft Consensus protocol, BSD licensed☆71Updated last year
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆74Updated 3 years ago
- ☆13Updated 3 years ago
- Embedded InnoDB based on v5.1☆30Updated 3 months ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated 5 months ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- ☆20Updated 2 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆36Updated 6 years ago
- Explore JIT in TiDB☆28Updated 3 years ago
- The C++ TiKV client used by TiFlash.☆41Updated last week
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆16Updated 6 years ago
- Quickstep project☆42Updated 3 months ago
- A high-performance, concurrent hash table☆24Updated 11 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- LeanStore is a larger-than-memory database, optimized for NVMe SSD and multi-core CPU, achieves performance close to in-memory systems wi…☆31Updated 5 months ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 10 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆99Updated 6 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025)☆42Updated last month
- C++ fast transactional key-value storage.☆163Updated 2 weeks ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- In-memory, columnar, arrow-based database.☆45Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆96Updated last year
- ☆12Updated 6 years ago