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:
- ☆20Updated 2 years ago
- ☆12Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆39Updated 5 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- ☆49Updated last year
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆27Updated last year
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- The Cicada engine☆59Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 4 months ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆55Updated last year
- ☆15Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- A simple, reference implementation of a B^e-tree☆160Updated 6 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Adaptive Radix Tree in C++☆48Updated this week
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆14Updated 2 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- In-memory, columnar, arrow-based database.☆48Updated 3 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago