caetanosauer / zeroLinks
Fork of the Shore-MT storage manager used by the research project Instant Recovery
☆30Updated 6 years ago
Alternatives and similar repositories for zero
Users that are interested in zero are comparing it to the libraries listed below
Sorting:
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- FOEDUS main source code repository☆63Updated 7 years ago
- ☆12Updated 6 years ago
- Concurrency Control Benchmark☆48Updated last year
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- The Cicada engine☆57Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆120Updated 3 years ago
- FOEDUS: Fast Optimistic Engine for Data Unification Services☆66Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆47Updated last year
- ☆146Updated 2 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- ☆29Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- LSM-trie☆114Updated 4 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- ☆35Updated last year
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Stand-alone implementation of the progressive indexing algorithms.☆16Updated 5 years ago
- pmwcas☆139Updated 2 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 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
- Quickstep project☆42Updated 7 months ago