tum-db / cachecoherence
☆10Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for cachecoherence
- 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
- ☆20Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- ☆12Updated 5 years ago
- ☆37Updated 4 years ago
- Artifact for PPoPP'18☆17Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- simd enabled column imprints☆11Updated 6 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆14Updated 5 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆38Updated 2 years ago
- ☆51Updated 5 months ago
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- ☆12Updated 4 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆22Updated 9 months ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- An open-source BzTree implementation☆90Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated last year
- Source code of our implementation of the concurrent RMA☆13Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- ☆37Updated 6 months ago
- ☆25Updated 7 years ago
- ☆14Updated last year