Bumped Ribbon Retrieval and Approximate Membership Query
☆51Jun 16, 2025Updated 8 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☆31Apr 1, 2025Updated 11 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 6 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Sep 12, 2022Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Feb 15, 2025Updated last year
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Dec 19, 2022Updated 3 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Jun 29, 2021Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Jun 27, 2023Updated 2 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆14Feb 23, 2023Updated 3 years ago
- A fast approximate membership query data structure☆12Jul 16, 2024Updated last year
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆15Jan 4, 2026Updated 2 months ago
- REplicated STORagE☆13Mar 23, 2023Updated 2 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆49Jan 22, 2026Updated last month
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated 10 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 10 months ago
- Vienna Graph Clustering☆17Feb 10, 2026Updated 3 weeks ago
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- ☆17Feb 11, 2026Updated 3 weeks ago
- ☆39Jun 20, 2020Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆251Feb 24, 2026Updated last week
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- Multi-platform topology-aware memory management library☆13Apr 23, 2020Updated 5 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 6 months ago
- ☆11Feb 21, 2023Updated 3 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 7 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆28Nov 4, 2024Updated last year
- Efficient Prefix-Sum data structures in C++.☆26Oct 1, 2023Updated 2 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- ☆54Nov 23, 2024Updated last year
- Fast Approximate Membership Filters (C++)☆289Aug 29, 2025Updated 6 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Grafite is a data structure that enables fast range emptiness queries using optimal space and time.☆14Dec 9, 2024Updated last year
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Mar 14, 2021Updated 4 years ago