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
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 8 years ago
- ☆38Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- ☆48Updated last year
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆55Updated last year
- Adaptive Radix Tree in C++☆47Updated last week
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated last month
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- A simple, reference implementation of a B^e-tree☆157Updated 6 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
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- ☆15Updated 5 years ago
- User-space Page Management☆108Updated last year
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆91Updated 2 years ago
- ☆14Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Order-preserving key encoder☆125Updated 5 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 5 years ago
- In-memory, columnar, arrow-based database.☆49Updated 3 years ago