3 citations · 4 across the 4 of their papers we have counts for
4 papers
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…
PUL: Pre-load in Software for Caches Wouldn't Always Play Along
Arthur Bernhardt, Sajjad Tamimi, Florian Stock +2
Memory latencies and bandwidth are major factors, limiting system performance and scalability. Modern CPUs aim at hiding latencies by employing large caches, out-of-order execution…
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…
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…