AMDComputeLibraries / morton_filterLinks
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
☆87Updated 4 years ago
Alternatives and similar repositories for morton_filter
Users that are interested in morton_filter are comparing it to the libraries listed below
Sorting:
- ☆52Updated 9 months ago
- High-performance dictionary coding☆106Updated 8 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆282Updated 3 weeks ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- LSM-trie☆114Updated 4 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- a quotient filter written in C☆86Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- ☆38Updated 5 years ago
- Succinct C++☆24Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 5 months ago
- ☆55Updated last year
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year