Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andreas Zimmerer

dblp:276/5735 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 4 since 2021

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
2 papers
Query processing and optimization · 78% Data models and query languages · 22%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
semantic query processing
1.012026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Query processing and optimization
join processing
0.912025
Parachute: Single-Pass Bi-Directional Information Passing · Proc. VLDB Endow. 2025
Query processing and optimization
query execution
0.912025
Parachute: Single-Pass Bi-Directional Information Passing · Proc. VLDB Endow. 2025
Data models and query languages › datalog › datalog query optimization
sideways information passing
0.912025
Parachute: Single-Pass Bi-Directional Information Passing · Proc. VLDB Endow. 2025
Performance modeling and evaluation
benchmarking
0.312026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Query processing and optimization
query optimization
0.312025
Parachute: Single-Pass Bi-Directional Information Passing · Proc. VLDB Endow. 2025

Methods — techniques the papers use, named apart from their topics

static analysis · 0.9
YearPublicationVenuePosition
2026 Waiting to Decompress: The Economics of LLM-Based Compression
Andreas Kipf, Ping-Lin Kuo, Skander Krid, Moritz Rengert, Luca Heller, Andreas Zimmerer, Mihail Stoian, Varun Pandey, Alexander van Renen
CIDR7
2026 SemBench: A Benchmark for Semantic Query Processing Engines
Jiale Lao, Andreas Zimmerer, Olga Ovcharenko, Tianji Cong, Matthew Russo, Gerardo Vitagliano, Michael Cochez, Fatma Özcan 0001, Gautam Gupta, Thibaud Hottelier, H. V. Jagadish, Kris Kissel, Sebastian Schelter, Andreas Kipf, Immanuel Trummer
Proc. VLDB Endow.2
2025 Virtual: Compressing Data Lake Files
Mihail Stoian, Alexander van Renen, Jan Kobiolka, Ping-Lin Kuo, Andreas Zimmerer, Josif Grabocka, Andreas Kipf
EDBT5
2025 Parachute: Single-Pass Bi-Directional Information Passing
abstract
Sideways information passing is a well-known technique for mitigating the impact of large build sides in a database query plan. As currently implemented in production systems, sideways information passing enables only a uni-directional information flow, as opposed to instance-optimal algorithms, such as Yannakakis'. On the other hand, the latter require an additional pass over the input, which hinders adoption in production systems. In this paper, we make a step towards enabling single-pass bidirectional information passing during query execution. We achieve this by statically analyzing between which tables the information flow is blocked and by leveraging precomputed join-induced fingerprint columns on FK-tables. On the JOB benchmark, Parachute improves DuckDB v1.2's end-to-end execution time without and with semi-join filtering by 1.54x and 1.24x, respectively, when allowed to use 15% extra space.
Mihail Stoian, Andreas Zimmerer, Skander Krid, Amadou Ngom, Jialin Ding 0001, Tim Kraska, Andreas Kipf
Proc. VLDB Endow.2