spcl / vldb19-distributed-locking
This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo Alonso. "Strong consistency is not hard to get: Two-Phase Locking and Two-Phase Commit on Thousands of Cores." In: PVLDB, 2020.
☆10Updated 5 years ago
Alternatives and similar repositories for vldb19-distributed-locking:
Users that are interested in vldb19-distributed-locking are comparing it to the libraries listed below
- ☆20Updated 2 years ago
- ☆53Updated 11 months ago
- ☆14Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 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
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 4 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆12Updated 3 years ago
- The Cicada engine☆55Updated 7 years ago
- ☆28Updated 2 years ago
- ☆12Updated 6 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Rust bindings for SPDK☆19Updated 7 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 5 years ago
- In-memory, columnar, arrow-based database.☆46Updated 2 years ago
- A fork of Couchbase ForestDB project, aiming at making it simple and generic☆17Updated 3 weeks ago
- ☆14Updated 3 years ago
- ☆28Updated 3 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆24Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆56Updated this week
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆52Updated last week
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆45Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago