mitdbg / deneva
Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
☆113Updated last year
Alternatives and similar repositories for deneva:
Users that are interested in deneva are comparing it to the libraries listed below
- ☆285Updated 2 years ago
- ☆143Updated last year
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆88Updated 2 years ago
- ☆116Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated last year
- Code for "SILK: Preventing Latency Spikes in Log-Structured Merge Key-Value Stores" published in USENIX ATC 19☆89Updated last year
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 4 months ago
- ☆58Updated last year
- Cicada SIGMOD 2017 evaluation☆16Updated 7 years ago
- Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree☆117Updated 3 years ago
- Yahoo! Cloud Serving Benchmark in C++, a C++ version of YCSB (https://github.com/brianfrankcooper/YCSB/wiki)☆157Updated 3 years ago
- ☆43Updated 3 years ago
- ☆70Updated 7 months ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- Key Value Store based on LevelDB☆111Updated 3 years ago
- Software Transactional Objects☆58Updated 10 months ago
- LB+-Tree implementation☆47Updated 3 years ago
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆71Updated 10 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆52Updated 4 months ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆74Updated 2 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- HOT - Height Optimized Trie☆142Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- A version of RocksDB that uses persistent memory☆92Updated 3 months ago
- A Relational Optimizer and Executor☆66Updated 2 months ago
- An open-source BzTree implementation☆91Updated 3 years ago