flippingbits / cssl
Cache-Sensitive Skip List.
☆22Updated 6 years ago
Alternatives and similar repositories for cssl:
Users that are interested in cssl are comparing it to the libraries listed below
- ☆37Updated 4 years ago
- The Cicada engine☆55Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- An open-source BzTree implementation☆90Updated 3 years ago
- HOT - Height Optimized Trie☆140Updated 6 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
- ☆20Updated 2 years ago
- ☆52Updated 8 months ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆87Updated 2 years ago
- ☆116Updated 2 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- ☆39Updated 9 months ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 8 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 5 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- A transactional main-memory database system on multicores☆102Updated 6 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
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆99Updated 6 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- ☆142Updated last year
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆47Updated 3 months ago
- Sequential implementation of the Rewired Memory Array.☆18Updated 5 years ago
- ☆12Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 4 years ago
- ☆26Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆153Updated 3 years ago
- ☆50Updated last month