lorenzhs / BuRRLinks
Bumped Ribbon Retrieval and Approximate Membership Query
☆50Updated 4 months ago
Alternatives and similar repositories for BuRR
Users that are interested in BuRR are comparing it to the libraries listed below
Sorting:
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- ☆38Updated 5 years ago
- ☆53Updated 10 months ago
- Succinct data structures in C/C++☆88Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆127Updated 9 months ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆88Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 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
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- ☆54Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Order-preserving key encoder☆125Updated 5 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 9 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆113Updated 9 months ago
- High-performance dictionary coding☆108Updated 8 years ago