Concurrency Control Benchmark
☆49Sep 3, 2023Updated 2 years ago
Alternatives and similar repositories for ccbench
Users that are interested in ccbench are comparing it to the libraries listed below
Sorting:
- An implementation of various in-memory concurrency control protocols☆28Mar 30, 2024Updated last year
- ☆290Dec 28, 2022Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Feb 26, 2022Updated 4 years ago
- C++ fast transactional key-value storage.☆177Feb 16, 2026Updated last week
- The Cicada engine☆59Jun 16, 2017Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Dec 11, 2022Updated 3 years ago
- GitHub Repo for Aria: A Fast and Practical Deterministic OLTP Database☆73Apr 15, 2024Updated last year
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Feb 14, 2022Updated 4 years ago
- Software Transactional Objects☆56Apr 5, 2024Updated last year
- FOEDUS main source code repository☆64Jun 26, 2017Updated 8 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆58Jun 27, 2022Updated 3 years ago
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Mar 6, 2023Updated 2 years ago
- ☆12Apr 26, 2023Updated 2 years ago
- Scalable Structural Index Constructor for JSON Analytics☆27Oct 10, 2024Updated last year
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆46Aug 12, 2025Updated 6 months ago
- Static analysis tool for xerrors (https://godoc.org/golang.org/x/xerrors)☆13Mar 31, 2019Updated 6 years ago
- Very Fast HTTP Parser☆15Dec 22, 2018Updated 7 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- ☆10May 15, 2024Updated last year
- ☆30Sep 14, 2022Updated 3 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Improving the tail latency of in-memory transactional system.☆10Mar 27, 2022Updated 3 years ago
- A comparison between different integer set techniques☆14Apr 13, 2018Updated 7 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Jan 19, 2018Updated 8 years ago
- A simple implementation of the packed memory array☆20Sep 1, 2013Updated 12 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- Disk backed concurrent ART implementation, with optional generations.☆14Nov 8, 2023Updated 2 years ago
- The logging module of the DBx1000 database.☆16Nov 2, 2020Updated 5 years ago
- ☆15Oct 4, 2022Updated 3 years ago
- ☆150Mar 11, 2023Updated 2 years ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 3 years ago
- TLA+ specification of Fast Flexible Paxos☆17Oct 9, 2020Updated 5 years ago
- Rabia: Simplifying State-Machine Replication Through Randomization (SOSP 2021)☆45Mar 16, 2023Updated 2 years ago
- A high-performance distributed graph database based on RDMA.☆18Apr 6, 2022Updated 3 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆22Apr 16, 2025Updated 10 months ago
- ☆20May 5, 2024Updated last year