Shao-Jie / SkimpyStashLinks
A key/value database based on SkimpyStash.
☆13Updated 10 years ago
Alternatives and similar repositories for SkimpyStash
Users that are interested in SkimpyStash are comparing it to the libraries listed below
Sorting:
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆32Updated 12 years ago
- LSM-trie☆114Updated 4 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- The Cicada engine☆59Updated 8 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆18Updated 7 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 5 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆56Updated 5 years ago
- ☆66Updated 5 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 15 years 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
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- This is a mirror of github.com/percona/PerconaFT that is kept here for legacy purposes.☆96Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Diamond reactive programming platform☆26Updated 3 years ago
- NOPaxos consensus protocol☆139Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- A fast in-memory key-value store☆52Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A parallel, pipelined query execution engine for multi-socket, multi-core systems with large main memories.☆17Updated 11 years ago
- A project to implement Augmented Time☆50Updated 11 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- ☆44Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆163Updated 6 years ago