Lukas Vogel

Lukas Vogel

Auto-generated profile, based on publicly available information

Lukas Vogel

Technische Universität München

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2019
Verified
Conference Paper
Open access
ARAlexander van Renen
Alexander van Renen
LVLukas Vogel
Lukas Vogel
VLViktor Leis
Viktor Leis
TNThomas Neumann
Thomas Neumann
AKAlfons Kemper
Alfons Kemper

2 October 2018
Verified
Conference Paper
Open access
PDF file
IAIlhan Aslan
Ilhan Aslan
TSTabea Schmidt
Tabea Schmidt
JWJens Woehrle
Jens Woehrle
LVLukas Vogel
Lukas Vogel
EAElisabeth André
Elisabeth André

23 September 2020 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
ARAlexander van Renen
Alexander van Renen
LVLukas Vogel
Lukas Vogel
VLViktor Leis
Viktor Leis
TNThomas Neumann
Thomas Neumann
AKAlfons Kemper
Alfons Kemper
I/O latency and throughput are two of the major performance bottlenecks for disk-based database systems. Persistent memory (PMem) technologies, like Intel’s Optane DC persistent memory modules, promise to bridge the gap between NAND-based flash (SSD) and DRAM, and thus eliminate the I/O bottleneck. In this paper, we provide the first comprehensive performance evaluation of PMem on real hardware in terms of bandwidth and latency. Based on the results, we develop guidelines for efficient PMem usage and four optimized low-level building blocks for PMem applications: log writing, block flushing, in-place updates, and coroutines for write latency hiding.

1 August 2020 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
LVLukas Vogel
Lukas Vogel
VLViktor Leis
Viktor Leis
ARAlexander van Renen
Alexander van Renen
TNThomas Neumann
Thomas Neumann
SISatoshi Imamura
Satoshi Imamura
AKAlfons Kemper
Alfons Kemper
Relational database systems are purpose-built for a specific storage device class (e.g., HDD, SSD, or DRAM). They do not cope well with the multitude of storage devices that are competitive at their price `sweet spots'. To make use of different storage device classes, users have to resort to workarounds, such as storing data in different tablespaces. A lot of research has been done on heterogeneous storage frameworks for distributed big data query engines. These engines scale well for big data sets but are often CPU- or network-bound. Both approaches only maximize performance for previously purchased storage devices. We present Mosaic, a storage engine for scan-heavy workloads on RDBMS that manages devices in a tierless pool and provides device purchase recommendations for a specified workload and budget. In contrast to existing systems, Mosaic generates a performance/budget curve that is Pareto-optimal, along which the user can choose. Our approach uses device models and linear optimization to find a data placement solution that maximizes I/O throughput for the workload. Our evaluation shows that Mosaic provides a higher throughput at the same budget or a similar throughput at a lower budget than the state-of-the-art approaches of big data query engines and RDBMS.

22 June 2023
Verified
Conference Paper
Open access
CAChristoph Anneser
Christoph Anneser
LVLukas Vogel
Lukas Vogel
FGFerdinand Gruber
Ferdinand Gruber
MBMaximilian Bandle
Maximilian Bandle
JGJana Giceva
Jana Giceva
With full resource disaggregation on the horizon, it is unclear what the most suitable programming model is that enables dataflow developers to fully harvest the potential that recent hardware developments offer. In our vision, we propose to raise the abstraction level to allow developers to primarily reason about their dataflow and the requirements that need to be met by the underlying system in a declarative fashion. Underneath, the system works with typed memory regions and uses the notion of ownership that allows for more flexible memory management across the different compute devices and the tasks mapped onto them. This requires a holistic approach that crosses multiple layers of the system stack, opening exciting systems research questions.

24 January 2025
Verified
Book Chapter
Open access
PDF file
LVLukas Vogel
Lukas Vogel
CAChristoph Anneser
Christoph Anneser
FGFerdinand Gruber
Ferdinand Gruber
TNThomas Neumann
Thomas Neumann
JGJana Giceva
Jana Giceva
AKAlfons Kemper
Alfons Kemper
In the past, the common assumption was that main memory would become cheap and abundant enough to power database systems solely. This assumption did not hold. This chapter presents approaches on how modern database systems can scale beyond a single server’s main memory capacity by utilizing trends in modern hardware without sacrificing performance. To this end, we present four systems: Mosaic, a storage engine for analytical workloads; Plush, a PMem-optimized storage structure for transactional workloads; PMFDS, a novel programming model for fully disaggregated systems; and finally, FireArm, a just-in-time compilation framework for rising ARM systems in the server space.