audreyccheng / taobenchLinks
A distributed database benchmark based on TAO's workload
☆42Updated last year
Alternatives and similar repositories for taobench
Users that are interested in taobench are comparing it to the libraries listed below
Sorting:
- ☆15Updated 5 years ago
- ☆30Updated 3 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"☆19Updated 7 months ago
- Quickstep project☆42Updated 11 months ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆60Updated 6 months ago
- Sundial: A distributed OLTP database testbed.☆37Updated 5 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- ☆36Updated 4 years ago
- ☆121Updated 2 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆66Updated last month
- Boki: Stateful Serverless Computing with Shared Logs [SOSP '21]☆83Updated 3 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- ☆73Updated last month
- InfiniStore: an elastic serverless cloud storage system (VLDB'23)☆24Updated 2 years ago
- ☆44Updated 4 years ago
- ☆53Updated 2 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆101Updated 2 years 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…☆124Updated last year
- ☆54Updated last year
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆74Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- Source code for the SIGMOD '23 paper “Polaris: Enabling Transaction Priority in Optimistic Concurrency Control”☆26Updated 2 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
- ☆15Updated 8 months ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- ☆73Updated 6 months ago
- ☆28Updated 4 years ago