3 citations · 3 across the 1 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2026
Bringing Data Transformations Near-Memory for Low-Latency Analytics in HTAP Environments
Arthur Bernhardt, David Volz, Sajjad Tamimi +2
In this paper we propose an approach for executing data transformations near- or in-storage on intelligent storage systems. The currently prevailing approach of extracting the data…
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…