EDBT 2026 Demo / reviewers in the wild / expert
Jonathan Dees
dblp:90/7867
· DBLP profile ↗
5ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
3 papers |
Query processing and optimization · 52% Database system architecture and tuning · 41% Distributed and cloud data management · 2% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
analytical workloads |
0.9 | 1 | 2025 | Workload Insights From the Snowflake Data Cloud: What Do Production Analytic Queries Really Look Like? · Proc. VLDB Endow. 2025 |
Database system architecture and tuning
workload characterization |
0.9 | 1 | 2025 | Workload Insights From the Snowflake Data Cloud: What Do Production Analytic Queries Really Look Like? · Proc. VLDB Endow. 2025 |
Cloud and datacenter computing
database-as-a-service |
0.9 | 1 | 2025 | Workload Insights From the Snowflake Data Cloud: What Do Production Analytic Queries Really Look Like? · Proc. VLDB Endow. 2025 |
Query processing and optimization › query execution › query operator implementation
columnar execution |
0.2 | 1 | 2013 | Efficient many-core query execution in main memory column-stores · ICDE 2013 |
Query processing and optimization › query execution
in-memory query processing |
0.2 | 1 | 2013 | Efficient many-core query execution in main memory column-stores · ICDE 2013 |
Query processing and optimization
parallel query processing |
0.2 | 1 | 2013 | Efficient many-core query execution in main memory column-stores · ICDE 2013 |
Distributed and cloud data management › large-scale data management
web-scale data management |
0.1 | 1 | 2015 | Towards a web-scale data management ecosystem demonstrated by SAP HANA · ICDE 2015 |
Indexing and storage engines
column store |
0.0 | 1 | 2013 | Efficient many-core query execution in main memory column-stores · ICDE 2013 |
Methods — techniques the papers use, named apart from their topics
query log analysis · 1.7domain-specific engine integration · 0.2inverted index · 0.2data-parallel execution · 0.2block summaries · 0.2NUMA-aware execution · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Workload Insights From the Snowflake Data Cloud: What Do Production Analytic Queries Really Look Like?abstractCapturing the characteristics of real-world analytical workloads is challenging yet critical for advancing industry practices and academic research. Historically, obtaining accurate query and data characteristics has been difficult, largely because detailed workload information has often been confined to on-premises database systems. With the rise of cloud-native databases like Snowflake, it has become possible to analyze production query workloads at scale and in greater detail. Leveraging this capability, this study presents a comprehensive analysis of analytics workloads across diverse customers and industries. In particular, we investigate the query characteristics of 667 million queries issued by the most popular BI tools against Snowflake over a two-week period. Based on this dataset, this paper makes two primary contributions: first, we conduct a detailed examination of query properties, with particular attention to filters, joins, aggregations, and other previously underexplored aspects. Second, we uncover unique and practically relevant query patterns that are typically absent from standard database benchmarks. Jan Vincent Szlang, Sebastian Breß, Sebastian Cattes, Jonathan Dees, Florian Funke 0004, Max Heimel, Michel Oleynik, Ismail Oukid, Tobias Maltenberger |
Proc. VLDB Endow. | 4 |
| 2015 | Towards a web-scale data management ecosystem demonstrated by SAP HANAabstractOver the years, data management has diversified and moved into multiple directions, mainly caused by a significant growth in the application space with different usage patterns, a massive change in the underlying hardware characteristics, and-last but not least-growing data volumes to be processed. A solution matching these constraints has to cope with a multidimensional problem space including techniques dealing with a large number of domain-specific data types, data and consistency models, deployment scenarios, and processing, storage, and communication infrastructures on a hardware level. Specialized database engines are available and are positioned in the market optimizing a particular dimension on the one hand while relaxing other aspects (e.g. web-scale deployment with relaxed consistency). Today it is common sense, that there is no single engine which can handle all the different dimensions equally well and therefore we have very good reasons to tackle this problem and optimize the dimensions with specialized approaches in a first step. However, we argue for a second step (reflecting in our opinion on the even harder problem) of a deep integration of individual engines into a single coherent and consistent data management ecosystem providing not only shared components but also a common understanding of the overall business semantics. More specifically, a data management ecosystem provides common “infrastructure” for software and data life cycle management, backup/recovery, replication and high availability, accounting and monitoring, and many other operational topics, where administrators and users expect a harmonized experience. More importantly from an application perspective however, customer experience teaches us to provide a consistent business view across all different components and the ability to seamlessly combine different capabilities. For example, within recent customer-based Internet of Things scenarios, a huge potential exists in combining graph-processing functionality with temporal and geospatial information and keywords extracted from high-throughput twitter streams. Using SAP HANA as the running example, we want to demonstrate what moving a set of individual engines and infra-structural components towards a holistic but also flexible data management ecosystem could look like. Although there are some solutions for some problems already visible on the horizon, we encourage the database research community in general to focus more on the Big Picture providing a holistic/integrated approach to efficiently deal with different types of data, with different access methods, and different consistency requirements-research in this field would push the envelope far beyond the traditional notion of data management. Franz Färber, Jonathan Dees, Martin Weidner, Stefan Bäuerle, Wolfgang Lehner |
ICDE | 2 |
| 2013 | Multi-level Parallel Query Execution Framework for CPU and GPU
Hannes Rauhe, Jonathan Dees, Kai-Uwe Sattler, Franz Färber |
ADBIS | 2 |
| 2013 | Fast OLAP query execution in main memory on large data in a clusterabstractMain memory column-stores have proven to be efficient for processing analytical queries. Still, there has been little work in the context of clusters. Using only a single machine poses several restrictions: Processing power and data volume are bounded to the number of cores and main memory fitting on one tightly coupled system. To enable the processing of larger data sets, switching to a cluster becomes necessary. In this work, we explore techniques for efficient execution of analytical SQL queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware. This includes precompiled query plans for efficient CPU utilization, full parallelization on single nodes and across the cluster, and efficient inter-node communication. We implement all features in a prototype for running a subset of TPC-H benchmark queries. We evaluate our implementation in a 128 node cluster running TPC-H queries with 30000 gigabyte of uncompressed data. Currently, there are no official cluster results for more than 10000 gigabyte of data, where we achieve up to one to two orders of magnitudes better performance than the current record holder. Martin Weidner, Jonathan Dees, Peter Sanders 0001 |
IEEE BigData | 2 |
| 2013 | Efficient many-core query execution in main memory column-storesabstractWe use the full query set of the TPC-H Benchmark as a case study for the efficient implementation of decision support queries on main memory column-store databases. Instead of splitting a query into separate independent operators, we consider the query as a whole and translate the execution plan into a single function performing the query. This allows highly efficient CPU utilization, minimal materialization, and execution in a single pass over the data for most queries. The single pass is performed in parallel and scales near-linearly with the number of cores. The resulting query plans for most of the 22 queries are remarkably simple and are suited for automatic generation and fast compilation. Using a data-parallel, NUMA-aware many-core implementation with block summaries, inverted index data structures, and efficient aggregation algorithms, we achieve one to two orders of magnitude better performance than the current record holders of the TPC-H Benchmark. Jonathan Dees, Peter Sanders 0001 |
ICDE | 1 |