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
- The Cicada engine☆55Updated 7 years ago
- ☆53Updated 10 months ago
- Quickstep project☆42Updated 4 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- ☆38Updated 4 years ago
- ☆12Updated 6 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- ☆20Updated 2 years ago
- Order-preserving key encoder☆122Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- ☆43Updated 11 months ago
- A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.☆104Updated 6 months ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆78Updated 2 years ago
- ☆116Updated 2 years ago
- In-memory, columnar, arrow-based database.☆45Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆12Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- A transactional main-memory database system on multicores☆103Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆55Updated 5 months ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 8 years ago
- Adaptive Radix Tree in C++☆41Updated this week
- pmwcas☆136Updated last year