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

Gerardo Vitagliano

dblp:249/4023 · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
11since 2021 · last 2026
0000-0001-7782-2596ORCID · verified

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

Databases, data management, data science and information retrieval · 11 · 3 first-author · 11 since 2021Artificial intelligence and machine learning · 1 · 1 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
5 papers
Query processing and optimization · 55% Data integration and cleaning · 29% Database system architecture and tuning · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
cost-based optimization
1.012026
Abacus: A Cost-Based Optimizer for Semantic Operator Systems · Proc. VLDB Endow. 2026
Query processing and optimization
semantic query processing
1.012026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Database system architecture and tuning › database administration
data loading
0.712023
Pollock: A Data Loading Benchmark · Proc. VLDB Endow. 2023
Data integration and cleaning › data extraction
spreadsheet data extraction
0.512021
Detecting Layout Templates in Complex Multiregion Files · Proc. VLDB Endow. 2021
Performance modeling and evaluation
benchmarking
0.522026
SemBench: A Benchmark for Semantic Query Processing Engines · Proc. VLDB Endow. 2026
Pollock: A Data Loading Benchmark · Proc. VLDB Endow. 2023
Query processing and optimization
query optimization
0.312026
Abacus: A Cost-Based Optimizer for Semantic Operator Systems · Proc. VLDB Endow. 2026

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

graph-based layout similarity · 1.1cost model · 1.0graph comparison · 0.5clustering · 0.5
YearPublicationVenuePosition
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.6
2026 Abacus: A Cost-Based Optimizer for Semantic Operator Systems
Matthew Russo, Chunwei Liu, Sivaprasad Sudhir, Gerardo Vitagliano, Michael J. Cafarella, Tim Kraska, Samuel Madden 0001
Proc. VLDB Endow.4
2025 Palimpzest: Optimizing AI-Powered Analytics with Declarative Query Processing
Chunwei Liu, Matthew Russo, Michael J. Cafarella, Lei Cao 0004, Peter Baile Chen, Zui Chen, Michael J. Franklin, Tim Kraska, Samuel Madden 0001, Rana Shahout, Gerardo Vitagliano
CIDR11
2024 TASHEEH: Repairing Row-Structure in Raw CSV Files
Mazhar Hameed 0001, Gerardo Vitagliano, Fabian Panse, Felix Naumann
EDBT2
2023 MORPHER: Structural Transformation of Ill-formed Rows
abstract
Open data portals contain a plethora of data files, with comma-separated value (CSV) files being particularly popular with users and businesses due to their flexible standard. However, this flexibility comes with much responsibility for data consumers, as many files contain various structural problems, e.g., a different number of cells across data rows, multiple value formats within the same column, different variants of quoted fields due to user specifications, etc. We refer to rows that contain such structural inconsistencies as ill-formed. Consequently, ingesting them into a host system, such as a database or an analytics platform, often requires prior data preparation steps.
Mazhar Hameed 0001, Gerardo Vitagliano, Felix Naumann
CIKM2
2023 Pollock: A Data Loading Benchmark
abstract
Any system at play in a data-driven project has a fundamental requirement: the ability to load data. The de-facto standard format to distribute and consume raw data is csv. Yet, the plain text and flexible nature of this format make such files often difficult to parse and correctly load their content, requiring cumbersome data preparation steps. We propose a benchmark to assess the robustness of systems in loading data from non-standard csv formats and with structural inconsistencies. First, we formalize a model to describe the issues that affect real-world files and use it to derive a systematic "pollution" process to generate dialects for any given grammar. Our benchmark leverages the pollution framework for the csv format. To guide pollution, we have surveyed thousands of real-world, publicly available csv files, recording the problems we encountered. We demonstrate the applicability of our benchmark by testing and scoring 16 different systems: popular csv parsing frameworks, relational database tools, spreadsheet systems, and a data visualization tool.
Gerardo Vitagliano, Mazhar Hameed 0001, Lan Jiang 0001, Lucas Reisener, Eugene Wu 0002, Felix Naumann
Proc. VLDB Endow.1
2022 Aggregation Detection in CSV Files
Lan Jiang 0001, Gerardo Vitagliano, Mazhar Hameed 0001, Felix Naumann
EDBT2
2022 SURAGH: Syntactic Pattern Matching to Identify Ill-Formed Records
Mazhar Hameed 0001, Gerardo Vitagliano, Lan Jiang 0001, Felix Naumann
EDBT2
2022 Mondrian: Spreadsheet Layout Detection
abstract
Spreadsheet datasets are valuable sources of data, but often ill-suited for machine consumption. Their unstructured nature allows users to arrange data and metadata freely in a human-readable format, often in canvas-like layouts. To extract their content, data practitioners need to resort to manual inspection and run cumbersome preparation pipelines. The Mondrian system assists users in identifying and handling multiregion layout templates: spreadsheet layouts composed of independent regions that appear repeatedly across different files. Mondrian comprises an automated approach to detect multiple regions within a single file and an algorithm that leverages mapping region layouts to graphs to compute layout similarity and identify templates. Users interact with Mondrian through a web-based visual interface, that serves as a practical toolkit to handle collections of multiregion spreadsheets and enables their automated preparation.
Gerardo Vitagliano, Lucas Reisener, Lan Jiang 0001, Mazhar Hameed 0001, Felix Naumann
SIGMOD Conference1
2021 Structure Detection in Verbose CSV Files
Lan Jiang 0001, Gerardo Vitagliano, Felix Naumann
EDBT2
2021 Detecting Layout Templates in Complex Multiregion Files
abstract
Spreadsheets are among the most commonly used file formats for data management, distribution, and analysis. Their widespread employment makes it easy to gather large collections of data, but their flexible canvas-based structure makes automated analysis difficult without heavy preparation. One of the common problems that practitioners face is the presence of multiple, independent regions in a single spreadsheet, possibly separated by repeated empty cells. We define such files as "multiregion" files. In collections of various spreadsheets, we can observe that some share the same layout. We present the Mondrian approach to automatically identify layout templates across multiple files and systematically extract the corresponding regions. Our approach is composed of three phases: first, each file is rendered as an image and inspected for elements that could form regions; then, using a clustering algorithm, the identified elements are grouped to form regions; finally, every file layout is represented as a graph and compared with others to find layout templates. We compare our method to state-of-the-art table recognition algorithms on two corpora of real-world enterprise spreadsheets. Our approach shows the best performances in detecting reliable region boundaries within each file and can correctly identify recurring layouts across files.
Gerardo Vitagliano, Lan Jiang 0001, Felix Naumann
Proc. VLDB Endow.1