wuxb45 / lsm-trieLinks
LSM-trie
☆114Updated 4 years ago
Alternatives and similar repositories for lsm-trie
Users that are interested in lsm-trie are comparing it to the libraries listed below
Sorting:
- Beta release of Masstree.☆444Updated last year
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- A simple, reference implementation of a B^e-tree☆156Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- Multicore in-memory storage engine☆389Updated 7 years ago
- The Cicada engine☆58Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- Order-preserving key encoder☆123Updated 5 years ago
- NVM key-value store API lIbrary repository.☆88Updated 11 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆95Updated 5 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- Persistent Memory Storage Engine☆24Updated 9 months ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- ☆149Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- QSBR and EBR library☆123Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- FOEDUS: Fast Optimistic Engine for Data Unification Services☆65Updated 8 years ago
- NOPaxos consensus protocol☆136Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 10 months ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- ☆121Updated 3 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Updated 9 years ago
- pmwcas☆139Updated 2 years ago