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
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 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
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- NOPaxos consensus protocol☆135Updated 4 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 6 years ago
- The Cicada engine☆57Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Persistent Memory Storage Engine☆24Updated 8 months ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆55Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A parallel, pipelined query execution engine for multi-socket, multi-core systems with large main memories.☆16Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆60Updated 6 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆18Updated 3 months ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- attempt at summarizing Raft in one page of pseudo-code☆20Updated 7 years ago
- An Elastic, Tiered-Storage Service☆30Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago