4 citations · 11 across the 6 of their papers we have counts for
Showing 2020Show all
2 papers · 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…
cs.DB2020
AnyDB: An Architecture-less DBMS for Any Workload
Tiemo Bang, Norman May, Ilia Petrov +1
In this paper, we propose a radical new approach for scale-out distributed DBMSs. Instead of hard-baking an architectural model, such as a shared-nothing architecture, into the dis…