most citedbloomRF: On Performing Range-Queries with Bloom-Filters based on Piecewise-Monotone Hash Functions and Dyadic Trace-Trees

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

collaborators
Showing cs.DBShow all

1 paper · 1 filter

cs.DB2020★ 1 cited

bloomRF: On Performing Range-Queries with Bloom-Filters based on Piecewise-Monotone Hash Functions and Dyadic Trace-Trees

Christian Riegger, Arthur Bernhardt, Bernhard Moessner +1

We introduce bloomRF as a unified method for approximate membership testing that supports both point- and range-queries on a single data structure. bloomRF extends Bloom-Filters wi…