TheHolyJoker / Comparing-FiltersLinks
Benchmarking Bloom, Cuckoo, Morton, and PD based filter.
☆15Updated 3 years ago
Alternatives and similar repositories for Comparing-Filters
Users that are interested in Comparing-Filters are comparing it to the libraries listed below
Sorting:
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- ☆51Updated 6 months ago
- Bloom filter implementation☆40Updated 2 years ago
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆37Updated 6 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- A C library implementation of a Cuckoo Filter☆25Updated 3 years ago
- a quotient filter written in C☆84Updated 7 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- A fast approximate membership query data structure☆11Updated 10 months ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆53Updated last year
- Fast Approximate Membership Filters (C++)☆278Updated 5 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- ☆38Updated 4 years ago
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- Persistent memory allocator for data-centric analytics☆54Updated last week
- ☆42Updated 13 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Updated 3 years ago
- this repository is a read only mirror, the upstream is☆70Updated 2 years ago
- Lenovo modifications to Linux memcached for enhanced persistent memory support☆16Updated 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
- Bloom filter alternative (C++)☆18Updated 6 years ago