flippingbits / csslLinks
Cache-Sensitive Skip List.
☆22Updated 7 years ago
Alternatives and similar repositories for cssl
Users that are interested in cssl are comparing it to the libraries listed below
Sorting:
- HOT - Height Optimized Trie☆156Updated 7 years ago
- The Cicada engine☆59Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- ☆122Updated 3 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
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- ☆38Updated 5 years ago
- ☆28Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆165Updated last year
- High-performance dictionary coding☆107Updated 8 years ago
- Order-preserving key encoder☆125Updated 5 years ago
- A simple, reference implementation of a B^e-tree☆157Updated 6 years ago
- ☆149Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- ☆48Updated last year
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆20Updated 2 years ago
- ☆12Updated 4 years ago
- ☆54Updated last year
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆102Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆165Updated 4 years ago
- Dependably fast multi-core in-memory transactions☆21Updated 8 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago