VLDB 2026 Research / reviewers in the wild / expert
Arthur Bernhardt
dblp:265/9609
· DBLP profile ↗
13ranked-venue papers in the field
6as first author
11since 2021 · last 2027
0009-0009-4056-4883ORCID · corroborated
Domains — venue-derived; a paper can count in several
Database Systems & Data Management · 13 (6 first)
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2027 | nDT: The case for in-storage Data TransformationsabstractIn this paper we propose an approach for performing data transformations near- or in-storage. The currently prevailing approach of extracting the data and then transforming it to a target format suffers data movement and causes degraded system performance. To mitigate these challenges we propose an approach offloading data transformations as near-data processing operations. The results show robust performance of foreground workloads and lower resource contention. We present opportunities in multi-engine and multi-system settings, for ML pipelines and for reuse. Arthur Bernhardt, Johannes Kratz, David Volz, Sajjad Tamimi, Andreas Koch 0001, Ilia Petrov 0001 |
EDBT | 1 |
| 2026 | Update NDP: On Offloading Modifications to Smart Storage with Transactional Guarantees in Near-Data Processing DBMSabstractThe performance and scalability of modern data-intensive systems processing large datasets are limited by unnecessary data movement. Even though near-data processing (NDP) can provably reduce data transfers and increase performance, at present, NDP is utilized primarily in read-only settings. Near-data execution of data-intensive modification operations is currently infeasible due to the lack of transactional consistency and the absence of practicable low-latency synchronization mechanisms between the host database engine and the NDP-engine on smart storage. In this article, we introduce update NDP as an approach to offloading modifications to computational storage with transactional guarantees in an NDP database system called neoDBMS . To ensure consistency, we introduce a low-latency shared lock table between the host and computational storage, based on novel cache-coherent interconnects . We also introduce a novel locking protocol that seamlessly integrates the shared lock table within the lock manager of the host NDP-engine. To handle failure recovery, while preserving high and robust performance, we introduce novel extended locking and logging mechanisms that allow the host and computational storage to perform useful work during log-movement. Our evaluation indicates that in-storage modifications in neoDBMS in mixed workload settings are ≥ 6.52× faster than host-only executions and exhibit robust performance due to lower data movement and better resource utilization. Arthur Bernhardt, Sajjad Tamimi, Florian Stock, Andreas Koch 0001, Ilia Petrov 0001 |
ACM Trans. Database Syst. | 1 |
| 2025 | PUL: Pre-load in Software for Caches Wouldn't Always Play Along
Arthur Bernhardt, Sajjad Tamimi, Florian Stock, Andreas Koch 0001, Ilia Petrov 0001 |
ADBIS | 1 |
| 2023 | pimDB: From Main-Memory DBMS to Processing-In-Memory DBMS-Engines on Intelligent MemoriesabstractThe performance and scalability of modern data-intensive systems are limited by massive data movement of growing datasets across the whole memory hierarchy to the CPUs. Such traditional processor-centric DBMS architectures are bandwidth- and latency-bound. Processing-in-Memory (PIM) designs seek to overcome these limitations by integrating memory and processing functionality on the same chip. PIM targets near- or in-memory data processing, leveraging the greater in-situ parallelism and bandwidth. Arthur Bernhardt, Andreas Koch 0001, Ilia Petrov 0001 |
DaMoN | 1 |
| 2023 | bloomRF: On Performing Range-Queries in Bloom-Filters with Piecewise-Monotone Hash Functions and Prefix Hashing
Bernhard Mößner, Christian Riegger, Arthur Bernhardt, Ilia Petrov 0001 |
EDBT | 3 |
| 2022 | Result-Set Management for NDP Operations on Smart StorageabstractCurrent data-intensive systems suffer from scalability as they transfer massive amounts of data to the host DBMS to process it there. Novel near-data processing (NDP) DBMS architectures and smart storage can provably reduce the impact of raw data movement. However, transferring the result-set of an NDP operation may increase the data movement, and thus, the performance overhead. In this paper, we introduce a set of in-situ NDP result-set management techniques, such as spilling, materialization, and reuse. Our evaluation indicates a performance improvement of 1.13 × to 400 ×. Tobias Vinçon, Christian Knödler, Arthur Bernhardt, Leonardo Solis-Vasquez, Lukas Weber, Andreas Koch 0001, Ilia Petrov 0001 |
DaMoN | 3 |
| 2022 | Cache-Coherent Shared Locking for Transactionally Consistent Updates in Near-Data Processing DBMS on Smart Storage
Arthur Bernhardt, Sajjad Tamimi, Florian Stock, Tobias Vinçon, Andreas Koch 0001, Ilia Petrov 0001 |
EDBT | 1 |
| 2022 | neoDBMS: In-situ Snapshots for Multi-Version DBMS on Native Computational StorageabstractMulti-versioning and MVCC are the foundations of many modern DBMSs. Under mixed workloads and large datasets, the creation of the transactional snapshot can become very expensive, as long-running analytical transactions may request old versions, residing on cold storage, for reasons of transactional consistency. Furthermore, analytical queries operate on cold data, stored on slow persistent storage. Due to the poor data locality, snapshot creation may cause massive data transfers and thus lower performance. Given the current trend towards computational storage and near-data processing, it has become viable to perform such operations in-storage to reduce data transfers and improve scalability. neoDBMS is a DBMS designed for near-data processing and computational storage. In this paper, we demonstrate how neoDBMS performs snapshot computation in-situ. We showcase different interactive scenarios, where neoDBMS outperforms PostgreSQL 12 by up to 5×. Arthur Bernhardt, Sajjad Tamimi, Tobias Vinçon, Christian Knödler, Florian Stock, Carsten Heinz, Andreas Koch 0001, Ilia Petrov 0001 |
ICDE | 1 |
| 2022 | On the necessity of explicit cross-layer data formats in near-data processing systemsabstractAbstract Massive data transfers in modern data-intensive systems resulting from low data-locality and data-to-code system design hurt their performance and scalability. Near-Data processing (NDP) and a shift to code-to-data designs may represent a viable solution as packaging combinations of storage and compute elements on the same device has become feasible. The shift towards NDP system architectures calls for revision of established principles. Abstractions such as data formats and layouts typically spread multiple layers in traditional DBMS, the way they are processed is encapsulated within these layers of abstraction. The NDP-style processing requires an explicit definition of cross-layer data formats and accessors to ensure in-situ executions optimally utilizing the properties of the underlying NDP storage and compute elements. In this paper, we make the case for such data format definitions and investigate the performance benefits under RocksDB and the COSMOS hardware platform. Lukas Weber, Tobias Vinçon, Christian Knödler, Leonardo Solis-Vasquez, Arthur Bernhardt, Ilia Petrov 0001, Andreas Koch 0001 |
Distributed Parallel Databases | 5 |
| 2022 | Near-Data Processing in Database Systems on Native Computational Storage under HTAP WorkloadsabstractToday's Hybrid Transactional and Analytical Processing (HTAP) systems, tackle the ever-growing data in combination with a mixture of transactional and analytical workloads. While optimizing for aspects such as data freshness and performance isolation, they build on the traditional data-to-code principle and may trigger massive cold data transfers that impair the overall performance and scalability. Firstly, in this paper we show that Near-Data Processing (NDP) naturally fits in the HTAP design space. Secondly, we propose an NDP database architecture, allowing transactionally consistent in-situ executions of analytical operations in HTAP settings. We evaluate the proposed architecture in state-of-the-art key/value-stores and multi-versioned DBMS. In contrast to traditional setups, our approach yields robust, resource- and cost-efficient performance. Tobias Vinçon, Christian Knödler, Leonardo Solis-Vasquez, Arthur Bernhardt, Sajjad Tamimi, Lukas Weber, Florian Stock, Andreas Koch 0001, Ilia Petrov 0001 |
Proc. VLDB Endow. | 4 |
| 2021 | A cost model for NDP-aware query optimization for KV-storesabstractMany modern DBMS architectures require transferring data from storage to process it afterwards. Given the continuously increasing amounts of data, data transfers quickly become a scalability limiting factor. Near-Data Processing and smart/computational storage emerge as promising trends allowing for decoupled in-situ operation execution, data transfer reduction and better bandwidth utilization. However, not every operation is suitable for an in-situ execution and a careful placement and optimization is needed. Christian Knödler, Tobias Vinçon, Arthur Bernhardt, Ilia Petrov 0001, Leonardo Solis-Vasquez, Lukas Weber, Andreas Koch 0001 |
DaMoN | 3 |
| 2020 | nKV: near-data processing with KV-stores on native computational storageabstractMassive data transfers in modern key/value stores resulting from low data-locality and data-to-code system design hurt their performance and scalability. Near-data processing (NDP) designs represent a feasible solution, which although not new, have yet to see widespread use. Tobias Vinçon, Arthur Bernhardt, Ilia Petrov 0001, Lukas Weber, Andreas Koch 0001 |
DaMoN | 2 |
| 2020 | nKV in Action: Accelerating KV-Stores on NativeComputational Storage with Near-Data ProcessingabstractMassive data transfers in modern data-intensive systems resulting from low data-locality and data-to-code system design hurt their performance and scalability. Near-data processing (NDP) designs represent a feasible solution, which although not new, has yet to see widespread use. In this paper we demonstrate various NDP alternatives in nKV, which is a key/value store utilizing native computational storage and near-data processing. We showcase the execution of classical operations ( GET, SCAN ) and complex graph-processing algorithms ( Betweenness Centrality ) in-situ, with 1.4x-2.7x better performance due to NDP. nKV runs on real hardware - the COSMOS+ platform. Tobias Vinçon, Lukas Weber, Arthur Bernhardt, Andreas Koch 0001, Ilia Petrov 0001, Christian Knödler, Sergey Hardock, Sajjad Tamimi, Christian Riegger |
Proc. VLDB Endow. | 3 |