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 quotient filter written in C☆86Updated 8 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆284Updated 3 weeks ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆52Updated 10 months ago
- Bloom filter implementation☆39Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A C library implementation of a Cuckoo Filter☆26Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆38Updated 6 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Header-only binary fuse and xor filter library☆411Updated 3 weeks ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Bloom filter alternative (C++)☆18Updated 6 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 6 years ago
- A simple and small bloom filter implementation in plain C.☆302Updated 3 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- Bloom filters for C++11☆363Updated 3 years ago
- A fast approximate membership query data structure☆11Updated last year
- C Minimal Perfect Hashing Library☆86Updated 8 years ago