efficient / memc3Links
MemC3
☆156Updated 8 years ago
Alternatives and similar repositories for memc3
Users that are interested in memc3 are comparing it to the libraries listed below
Sorting:
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆212Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Beta release of Masstree.☆450Updated 2 years ago
- Persistent Memory Storage Engine☆24Updated last year
- Multicore in-memory storage engine☆397Updated 8 years ago
- Embedded storage benchmarking tool☆139Updated this week
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- NOPaxos consensus protocol☆139Updated 5 years ago
- Redis adapted to use Persistent Memory☆58Updated 4 years ago
- A transactional main-memory database system on multicores☆105Updated 7 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 15 years ago
- The Cicada engine☆59Updated 8 years ago
- A benchmark to compare synchronization techniques for multicore programming☆348Updated 6 months ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆24Updated 10 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 5 years ago
- A fork of LevelDB intended to meet the needs of HyperDex while remaining compatible with LevelDB.☆464Updated 9 years ago
- FOEDUS: Fast Optimistic Engine for Data Unification Services☆65Updated 8 years ago
- pmwcas☆139Updated 2 years ago
- ☆150Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Updated 6 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- A fast in-memory key-value store☆52Updated 8 years ago
- New IndexFS core☆26Updated 9 years ago