most citedbloomRF: On Performing Range-Queries in Bloom-Filters with Piecewise-Monotone Hash Functions and Prefix Hashing

3 citations · 3 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DB2022★ 3 cited

bloomRF: On Performing Range-Queries in Bloom-Filters with Piecewise-Monotone Hash Functions and Prefix Hashing

Bernhard Mößner, Christian Riegger, Arthur Bernhardt +1

We introduce bloomRF as a unified method for approximate membership testing that supports both point- and range-queries. As a first core idea, bloomRF introduces novel prefix hashi…