vedantk / quotient-filterLinks
a quotient filter written in C
☆88Updated 8 years ago
Alternatives and similar repositories for quotient-filter
Users that are interested in quotient-filter are comparing it to the libraries listed below
Sorting:
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Embedded storage benchmarking tool☆139Updated 3 weeks ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Fast decoder for VByte-compressed integers☆127Updated 2 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆178Updated 3 years ago
- Rolling Hash C++ Library☆190Updated last year
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆274Updated 6 months ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- Lock-free multithreaded memory allocation☆110Updated 9 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago
- ☆53Updated last year