3 papers
cs.DC2026
cuSBF: A Minimizer-Aware Bloom Filter for Genomic Sequence Data on Modern GPUs
Tim Dortmann, Markus Vieth, Bertil Schmidt
Efficient genomic k-mer indexing depends on approximate membership query (AMQ) structures that must deliver high throughput, low false-positive rates (FPR), and modest memory footp…
cs.DC2026
Cuckoo-GPU: Accelerating Cuckoo Filters on Modern GPUs
Tim Dortmann, Markus Vieth, Bertil Schmidt
Approximate Membership Query (AMQ) structures are essential for high-throughput systems in databases, networking, and bioinformatics. While Bloom filters offer speed, they lack sup…
cs.DC2025
Optimizing Bloom Filters on Modern GPUs
Daniel Jünger, Daniel Jünger, Kevin Kristensen +3
Bloom filters are a fundamental data structure for approximate membership queries in applications ranging from analytics and databases to genomics. Deployed as prefilters, they eli…