Shao-Jie / SkimpyStash
A key/value database based on SkimpyStash.
☆13Updated 9 years ago
Related projects: ⓘ
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 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 11 years ago
- Implementation of the BwTree as specified by Microsoft Research☆97Updated 8 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 12 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- A cache-efficiency weight balanced binary tree☆69Updated 10 years ago
- ☆43Updated 3 years ago
- Libhalog is an open-source high available redo-log library using multiple paxos.☆37Updated 6 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆26Updated 3 years ago
- Experiments in partially ordered SMR.☆45Updated 3 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆34Updated 4 years ago
- ☆22Updated this week
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated 2 weeks ago
- A toy SQL engine built on top of LSM(LevelDB)☆24Updated 5 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆40Updated last year
- The Cicada engine☆56Updated 7 years ago
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 9 years ago
- The C++ TiKV client used by TiFlash.☆40Updated last week
- rocksdb replicated using rDSN (simple mode)☆12Updated 8 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆55Updated 7 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 8 years ago
- ☆12Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 13 years ago
- A project to implement Augmented Time☆48Updated 10 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆96Updated 6 years ago
- An attempt to split the Raft library out of LogCabin☆38Updated 6 years ago
- Persistent Memory Storage Engine☆24Updated 3 years ago
- ☆64Updated 3 years ago