barrust / bloomLinks
Bloom filter implementation
☆39Updated 2 years ago
Alternatives and similar repositories for bloom
Users that are interested in bloom are comparing it to the libraries listed below
Sorting:
- Benchmarking Bloom, Cuckoo, Morton, and PD based filter.☆15Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆286Updated 2 months ago
- ☆53Updated 11 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- this repository is a read only mirror, the upstream is☆73Updated 3 years ago
- ☆282Updated 2 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- ☆34Updated 6 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆132Updated 7 months ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆38Updated 7 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆79Updated 4 years ago
- Kuku is a compact and convenient cuckoo hashing library written in C++.☆67Updated last year
- Header-only binary fuse and xor filter library☆411Updated 2 months ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆244Updated this week
- Buffer based LRU cache☆40Updated 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
- Library for lock-free locks☆83Updated 2 years ago
- A simple and small bloom filter implementation in plain C.☆301Updated 3 years ago
- A fast in-memory key-value store☆51Updated 8 years ago
- Leopard-RS : O(N Log N) MDS Reed-Solomon Block Erasure Code for Large Data☆153Updated last year
- Learned Monotone Minimal Perfect Hashing☆31Updated 7 months ago
- A C++11 simulator for a variety of CDN caching policies.☆51Updated 4 years ago
- Fast Erasure Coding Library for Large Number of Data and Parities☆29Updated 5 years ago
- Implementation of Count Min Sketch in C++☆57Updated 6 years ago
- A fast approximate membership query data structure☆11Updated last year
- ☆30Updated 6 years ago
- Concurrent trie-hash map library☆92Updated 2 years ago
- Intel® Cryptography Primitives Library is a secure, fast and lightweight library of building blocks for cryptography, highly-optimized fo…☆364Updated this week