4 citations · 11 across the 6 of their papers we have counts for
6 papers · 1 filter
Storage Management with Multi-Version Partitioned B-Trees
Christian Riegger, Ilia Petrov
Database Management Systems and K/V-Stores operate on updatable datasets -- massively exceeding the size of available main memory. Tree-based K/V storage management structures beca…
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…
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…
MV-PBT: Multi-Version Index for Large Datasets and HTAP Workloads
Christian Riegger, Tobias Vincon, Robert Gottstein +1
Modern mixed (HTAP) workloads execute fast update-transactions and long-running analytical queries on the same dataset and system. In multi-version (MVCC) systems, such workloads r…
Moving Processing to Data: On the Influence of Processing in Memory on Data Management
Tobias Vincon, Andreas Koch, Ilia Petrov
Near-Data Processing refers to an architectural hardware and software paradigm, based on the co-location of storage and compute units. Ideally, it will allow to execute application…