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☆174Updated 13 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 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
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆43Updated 3 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 7 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- ☆12Updated 6 years ago
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 10 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 11 years ago
- ☆14Updated 3 years ago
- The Cicada engine☆57Updated 8 years ago
- ☆54Updated last year
- Persistent Memory Storage Engine☆24Updated 7 months ago
- ☆26Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- BLInk Tree logic - storage and locking experiment☆27Updated 10 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 2 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 3 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