wuxb45 / wormholeLinks
Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
☆82Updated 3 years ago
Alternatives and similar repositories for wormhole
Users that are interested in wormhole are comparing it to the libraries listed below
Sorting:
- HOT - Height Optimized Trie☆156Updated 7 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆149Updated 2 years ago
- ☆124Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- The Cicada engine☆59Updated 8 years ago
- ☆30Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- pmwcas☆138Updated 2 years ago
- A simple, reference implementation of a B^e-tree☆158Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- Software Transactional Objects☆56Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- Key Value Store based on LevelDB☆116Updated 4 years ago
- Sundial: A distributed OLTP database testbed.☆38Updated 5 years ago
- ☆55Updated last year
- ☆48Updated last year
- ☆74Updated 2 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆119Updated 4 years ago
- Order-preserving key encoder☆126Updated 5 years ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆125Updated last year
- Optimistic queue-based reader-writer lock for robust index synchronization (SIGMOD 2024)☆24Updated last year
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆68Updated 2 months ago