AMDComputeLibraries / morton_filter
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
☆86Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for morton_filter
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- ☆52Updated 6 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆50Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆126Updated last year
- HOT - Height Optimized Trie☆140Updated 6 years ago
- ☆37Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Fast Approximate Membership Filters (C++)☆263Updated 10 months ago
- High-performance dictionary coding☆103Updated 7 years ago
- a quotient filter written in C☆84Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Succinct C++☆25Updated 4 years ago
- ☆12Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 years ago
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- ☆37Updated 7 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 11 months ago
- NVM Evaluation Testbed☆28Updated 6 years ago
- LSM-trie☆114Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆81Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 7 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