UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
☆29Updated 3 years ago
Alternatives and similar repositories for Efficiently-Searching-In-Memory-Sorted-Arrays:
Users that are interested in Efficiently-Searching-In-Memory-Sorted-Arrays are comparing it to the libraries listed below
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- ☆53Updated 11 months ago
- The Cicada engine☆57Updated 7 years ago
- ☆50Updated 5 months ago
- ☆20Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- ☆38Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- Order-preserving key encoder☆122Updated 5 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- ☆12Updated 6 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- An open-source BzTree implementation☆92Updated 3 years ago
- ☆12Updated 3 years ago
- ☆45Updated last year
- pmwcas☆137Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- HOT - Height Optimized Trie☆149Updated 7 years ago
- Quickstep project☆42Updated 5 months ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆119Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆28Updated 2 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆45Updated last year
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago