tum-db / cachecoherenceLinks
☆12Updated 4 years ago
Alternatives and similar repositories for cachecoherence
Users that are interested in cachecoherence are comparing it to the libraries listed below
Sorting:
- ☆12Updated 6 years ago
- ☆20Updated 2 years ago
- ☆38Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆48Updated last year
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Adaptive Radix Tree in C++☆45Updated last week
- ☆15Updated 5 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- The Cicada engine☆57Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- ☆54Updated last year
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A simple, reference implementation of a B^e-tree☆155Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- Order-preserving key encoder☆123Updated 5 years ago
- ☆29Updated 2 years ago