Daniel Ritter
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniel Ritter has a total of 104 co-authors. Here are the top co-authors by number of shared publications:
- Norman May
SAP SE, Walldorf, Germany
7 shared publications Stefanie Rinderle-Ma
5 shared publications- Stefanie Rinderle-Ma
Technical University of Munich
5 shared publications Andrey Rivkin
3 shared publications- Holger Fröning
Institute of Computer Engineering, Heidelberg University
3 shared publications - Jonas Dann
ETH Zurich, Zurich, Switzerland
3 shared publications
Latest Publications
- Open Access
- 19 August 2026
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 26 (3) , 289-293
Five-Minute Rule for Data Analytics in the Cloud
Traditionally, deploying database systems required acquiring and managing large, expensive servers on-premise. These servers feature a memory and storage hierarchy, including CPU caches, DRAM memory, HDDs and/or SSDs, and sometimes tape. For almost 40 years, Gray and Putzolu’s five-minute rule [4, 10, 12, 13] has helped guide system architects to the break-even point between memory caching and direct local storage access for these systems. The rise of cloud computing has significantly changed the way systems are deployed. Cloud services offer on-demand computing and storage, removing the need for companies to acquire and manage their own hardware. Furthermore, the cloud has introduced a new layer of the storage hierarchy for database systems: object stores . This durability and low cost have made object stores ubiquitous in modern cloud-native databases and data infrastructures [5, 6, 16]. We believe a rule of thumb similar to the five-minute rule is needed for object caches and storage for disaggregated cloud data system designs. However, it is not straightforward to adapt the established rules to the cloud as they presume fixed hardware, while, in the cloud, resources are dynamic and costs are determined by usage. One can argue that accessing object stores over the network incurs higher latency and lower bandwidth than directly attached storage devices, placing them at the bottom of the storage hierarchy. However, advances in cloud storage and networking have significantly impacted cost-effectiveness, latency variability, and dynamic workload optimization, challenging these traditional assumptions. For example, in non-storage-optimized AWS instances, network bandwidth often exceeds local storage read bandwidth, and writing to local storage devices tends to be half as fast as reading, while writing to S3 can match network bandwidth. This paper is a summary of our earlier work work [9] that proposes a cost model and new rules of thumb to help system designers determine when caches become cost-effective for analytical workloads in the cloud. While perhaps unsurprising, our analysis on AWS shows that caches are beneficial when a system makes (1) two requests per hour for latency-sensitive workloads, or (2) seven requests per second for non-latency-sensitive workloads. These results are consistent with and help explain the near ubiquity of object store caches in cloud analytics systems.
- 19 August 2026
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 26 (3) , 289-293
Open AccessFive-Minute Rule for Data Analytics in the Cloud
Traditionally, deploying database systems required acquiring and managing large, expensive servers on-premise. These servers feature a memory and storage hierarchy, including CPU caches, DRAM memory, HDDs and/or SSDs, and sometimes tape. For almost 40 years, Gray and Putzolu’s five-minute rule [4, 10, 12, 13] has helped guide system architects to the break-even point between memory caching and direct local storage access for these systems. The rise of cloud computing has significantly changed the way systems are deployed. Cloud services offer on-demand computing and storage, removing the need for companies to acquire and manage their own hardware. Furthermore, the cloud has introduced a new layer of the storage hierarchy for database systems: object stores . This durability and low cost have made object stores ubiquitous in modern cloud-native databases and data infrastructures [5, 6, 16]. We believe a rule of thumb similar to the five-minute rule is needed for object caches and storage for disaggregated cloud data system designs. However, it is not straightforward to adapt the established rules to the cloud as they presume fixed hardware, while, in the cloud, resources are dynamic and costs are determined by usage. One can argue that accessing object stores over the network incurs higher latency and lower bandwidth than directly attached storage devices, placing them at the bottom of the storage hierarchy. However, advances in cloud storage and networking have significantly impacted cost-effectiveness, latency variability, and dynamic workload optimization, challenging these traditional assumptions. For example, in non-storage-optimized AWS instances, network bandwidth often exceeds local storage read bandwidth, and writing to local storage devices tends to be half as fast as reading, while writing to S3 can match network bandwidth. This paper is a summary of our earlier work work [9] that proposes a cost model and new rules of thumb to help system designers determine when caches become cost-effective for analytical workloads in the cloud. While perhaps unsurprising, our analysis on AWS shows that caches are beneficial when a system makes (1) two requests per hour for latency-sensitive workloads, or (2) seven requests per second for non-latency-sensitive workloads. These results are consistent with and help explain the near ubiquity of object store caches in cloud analytics systems.
- 23 June 2026
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 26 (2) , 1-16
Locality-Aware Memory Tiering with CXL for in-Memory Database Management Systems
- 23 June 2026
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 26 (2) , 1-16
Locality-Aware Memory Tiering with CXL for in-Memory Database Management Systems
- Open Access
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Efficient Parquet Parsing on FPGAs
- 31 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessEfficient Parquet Parsing on FPGAs
- Open Access
- 30 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 34-37
Demonstrating CloudGlide: Interactive Exploration of Cloud Analytics Architectures
- 30 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 34-37
Open AccessDemonstrating CloudGlide: Interactive Exploration of Cloud Analytics Architectures
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-26
GraphMatch: Subgraph Query Processing on Steroids
Recently, graphs are becoming increasingly interesting in the context of large language models and as overlays for commercial databases. Subgraph query processing is an especially challenging workload for graph analysis that is bottlenecked by slow set intersection performance on CPUs. Previous work has shown the viability of utilizing hardware acceleration for related domains like graph and relational join processing. We propose GraphMatch, a hardware-accelerated subgraph query processing system based on worst-case optimal joins (WCOJ). For efficient processing of various data and query graphs, we propose a novel set intersection algorithm, called MaxStep, that leverages hardware parallelism. GraphMatch combines MaxStep operators in a data flow architecture which efficiently solves multi-set intersections in subgraph query processing, superior to CPU-based approaches. GraphMatch achieves an average speedup of over 6.98x and 17.08x, compared to the state-of-the-art WCOJ-based systems GraphFlow and RapidMatch, respectively. On labeled graphs, GraphMatch outperforms the fastest subgraph query processing accelerator FAST by orders of magnitude.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-26
Open AccessGraphMatch: Subgraph Query Processing on Steroids
Recently, graphs are becoming increasingly interesting in the context of large language models and as overlays for commercial databases. Subgraph query processing is an especially challenging workload for graph analysis that is bottlenecked by slow set intersection performance on CPUs. Previous work has shown the viability of utilizing hardware acceleration for related domains like graph and relational join processing. We propose GraphMatch, a hardware-accelerated subgraph query processing system based on worst-case optimal joins (WCOJ). For efficient processing of various data and query graphs, we propose a novel set intersection algorithm, called MaxStep, that leverages hardware parallelism. GraphMatch combines MaxStep operators in a data flow architecture which efficiently solves multi-set intersections in subgraph query processing, superior to CPU-based approaches. GraphMatch achieves an average speedup of over 6.98x and 17.08x, compared to the state-of-the-art WCOJ-based systems GraphFlow and RapidMatch, respectively. On labeled graphs, GraphMatch outperforms the fastest subgraph query processing accelerator FAST by orders of magnitude.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Exploiting Locality in Flat Memory with CXL for In-Memory Database Management Systems
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessExploiting Locality in Flat Memory with CXL for In-Memory Database Management Systems
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 485-498
Enterprise Application-Database Co-Innovation for Hybrid Transactional/Analytical Processing: A Virtual Data Model and Its Query Optimization Needs
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 485-498
Open AccessEnterprise Application-Database Co-Innovation for Hybrid Transactional/Analytical Processing: A Virtual Data Model and Its Query Optimization Needs
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 580-592
SAP HANA Cloud: Data Management for Modern Enterprise Applications
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 580-592
Open AccessSAP HANA Cloud: Data Management for Modern Enterprise Applications
- Open Access
- 13 March 2025
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 25 (1) , 29-38
Skyrise: Exploiting Serverless Cloud Infrastructure for Elastic Data Processing
Serverless computing offers elasticity unmatched by conventional server-based cloud infrastructure. Although modern data processing systems embrace serverless storage, such as Amazon S3, they continue to manage their compute resources as servers. This is challenging for unpredictable workloads, leaving clusters often underutilized. Recent research shows the potential of serverless compute resources, such as cloud functions, for elastic data processing, but also sees limitations in performance robustness and cost efficiency for long running workloads. These challenges require holistic approaches across the system stack. However, to the best of our knowledge, there is no end-to-end data processing system built entirely on serverless infrastructure. In this paper, we present Skyrise, our effort towards building the first fully serverless SQL query processor. Skyrise exploits the elasticity of its underlying infrastructure, while alleviating the inherent limitations with a number of adaptive and cost-aware techniques. We show that both Skyrise’s performance and cost are competitive to other cloud data systems for terabyte-scale queries of the analytical TPC‑H benchmark.
- 13 March 2025
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 25 (1) , 29-38
Open AccessSkyrise: Exploiting Serverless Cloud Infrastructure for Elastic Data Processing
Serverless computing offers elasticity unmatched by conventional server-based cloud infrastructure. Although modern data processing systems embrace serverless storage, such as Amazon S3, they continue to manage their compute resources as servers. This is challenging for unpredictable workloads, leaving clusters often underutilized. Recent research shows the potential of serverless compute resources, such as cloud functions, for elastic data processing, but also sees limitations in performance robustness and cost efficiency for long running workloads. These challenges require holistic approaches across the system stack. However, to the best of our knowledge, there is no end-to-end data processing system built entirely on serverless infrastructure. In this paper, we present Skyrise, our effort towards building the first fully serverless SQL query processor. Skyrise exploits the elasticity of its underlying infrastructure, while alleviating the inherent limitations with a number of adaptive and cost-aware techniques. We show that both Skyrise’s performance and cost are competitive to other cloud data systems for terabyte-scale queries of the analytical TPC‑H benchmark.
- 7 March 2025
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 25 (1) , 5-16
Elastic Compute in SAP HANA Cloud by Example of SAP Integrated Business Planning
- 7 March 2025
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 25 (1) , 5-16
Elastic Compute in SAP HANA Cloud by Example of SAP Integrated Business Planning