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)☆89Updated 5 years ago
- Bloom filter implementation☆42Updated 2 weeks ago
- C library to compute the Hamming weight of arrays☆49Updated 7 years ago
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆38Updated 7 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- ☆53Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- a quotient filter written in C☆87Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 3 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 6 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Updated 2 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- STL-compliant map and set container based on a C++11 Adaptive Radix Tree implementation.☆11Updated 9 years ago
- Concurrent trie-hash map library☆93Updated 2 years ago
- A fast approximate membership query data structure☆12Updated last year
- A C library implementation of a Cuckoo Filter☆26Updated 4 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Bloom filter alternative (C++)☆18Updated 7 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Embedded storage benchmarking tool☆139Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 10 months ago