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:
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 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
- LSM-trie☆114Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- Solitaire is a Faster Linearizability Checker Supporting Multiple Data Model☆17Updated 7 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- ☆66Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- NOPaxos consensus protocol☆136Updated 4 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Diamond reactive programming platform☆26Updated 3 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- ☆44Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- The Cicada engine☆58Updated 8 years 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
- ☆12Updated 6 years ago
- Persistent Memory Storage Engine☆24Updated 9 months ago
- RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance☆55Updated 4 years ago
- A cache-efficiency weight balanced binary tree☆70Updated 11 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
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- A parallel, pipelined query execution engine for multi-socket, multi-core systems with large main memories.☆16Updated 11 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆207Updated 9 years ago