Bumped Ribbon Retrieval and Approximate Membership Query
☆52Jun 16, 2025Updated last year
Alternatives and similar repositories for BuRR
Users that are interested in BuRR are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 11 months ago
- Learned Monotone Minimal Perfect Hashing☆32Apr 1, 2025Updated last year
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆13Sep 8, 2025Updated 11 months ago
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆10Dec 19, 2022Updated 3 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- FREIGHT: Fast Streaming Hypergraph Partitioning — SEA 2023 Best Paper Award☆16Apr 15, 2026Updated 4 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 3 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 7 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆39Dec 20, 2022Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 4 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆59Aug 17, 2026Updated 2 weeks ago
- Vienna Graph Clustering☆18Jun 1, 2026Updated 3 months ago
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 5 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆36Apr 7, 2025Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Jun 27, 2023Updated 3 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- ☆18Feb 11, 2026Updated 6 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆71Updated this week
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆30Nov 4, 2024Updated last year
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13Updated this week
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Scalable Automated Reasoning for HPC and Clouds☆94Updated this week
- A fast approximate membership query data structure☆12Jul 16, 2024Updated 2 years ago
- Python Frontend to Algorithms of the Algorithm Engineering Group Heidelberg☆27Apr 24, 2026Updated 4 months ago
- KaGen: Communication-free Massively Distributed Graph Generators☆44Updated this week
- Experiments with array layouts for comparison-based searching☆88Jan 5, 2024Updated 2 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆266Jul 27, 2026Updated last month
- Succinct data structures in C/C++☆95May 5, 2026Updated 3 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆167Jan 15, 2025Updated last year
- Fast Approximate Membership Filters (C++)☆287Aug 29, 2025Updated last year
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A C++ library to benchmark inverted indexes.☆24Aug 4, 2020Updated 6 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 5 years ago
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 years ago
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- ☆40Jun 20, 2020Updated 6 years ago