viktorleis / mmapbenchLinks
☆137Updated 3 years ago
Alternatives and similar repositories for mmapbench
Users that are interested in mmapbench are comparing it to the libraries listed below
Sorting:
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆61Updated 2 months ago
- ☆70Updated 3 months ago
- An open-source BzTree implementation☆92Updated 3 years ago
- a high performance cache simulator and library☆106Updated 10 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆58Updated 2 months ago
- This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…☆123Updated 9 months ago
- ☆47Updated last year
- An update-in-place key-value store for modern storage.☆142Updated last year
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- OpenAurora is a cloud-native database system prototype developed at Purdue University. It is an open-source version of Amazon Aurora. It …☆94Updated 3 weeks ago
- HOT - Height Optimized Trie☆154Updated 7 years ago
- ☆54Updated last year
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 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
- ☆148Updated 2 years ago
- AnyBlob - A Universal Cloud Object Storage Download Manager Built For Cost-Throughput Optimal Analytics!☆130Updated 2 weeks ago
- Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index☆57Updated 9 months ago
- The repo for SOSP23 paper: FIFO queues are all you need for cache evictions☆123Updated last year
- An adaptive radix tree for efficient indexing in main memory.☆161Updated last year
- ☆121Updated 3 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆49Updated last year
- 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
- Adaptive Radix Tree in C++☆45Updated last month
- Quickstep project☆42Updated 8 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- Reproducibility package for "Two Birds With One Stone: Designing a Hybrid Cloud Storage Engine for HTAP"☆22Updated last year
- ☆20Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆121Updated 2 years ago
- Scalable Hashing on Persistent Memory☆193Updated last year