tum-db / cachecoherenceLinks
☆12Updated 3 years ago
Alternatives and similar repositories for cachecoherence
Users that are interested in cachecoherence are comparing it to the libraries listed below
Sorting:
- ☆20Updated 2 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- ☆38Updated 5 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- ☆54Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆12Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆47Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Skeena: Efficient and Consistent Cross-Engine Transactions (SIGMOD 2022, ACM SIGMOD Research Highlights Award 2022)☆21Updated 2 years ago
- ☆14Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆59Updated 2 months ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 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
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆56Updated last month
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago