Lan Jiang 0001

dblp:18/2122-1 · DBLP profile ↗
← Back
8ranked-venue papers in the field
3as first author
6since 2021 · last 2023
0000-0002-4735-3845ORCID · verified

Domains — venue-derived; a paper can count in several

Database Systems & Data Management · 6 (2 first)Information Retrieval & Web Search · 1Knowledge Engineering, Semantic Web & Information Systems · 1 (1 first)
YearPublicationVenuePosition
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.3
2022 Aggregation Detection in CSV Files
Lan Jiang 0001, Gerardo Vitagliano, Mazhar Hameed 0001, Felix Naumann
EDBT1
2022 SURAGH: Syntactic Pattern Matching to Identify Ill-Formed Records
Mazhar Hameed 0001, Gerardo Vitagliano, Lan Jiang 0001, Felix Naumann
EDBT3
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 Conference3
2021 Structure Detection in Verbose CSV Files
Lan Jiang 0001, Gerardo Vitagliano, Felix Naumann
EDBT1
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.2
2020 Holistic primary key and foreign key detection
Lan Jiang 0001, Felix Naumann
J. Intell. Inf. Syst.1
2019 Inclusion Dependency Discovery: An Experimental Evaluation of Thirteen Algorithms
abstract
Inclusion dependencies are an important type of metadata in relational databases, because they indicate foreign key relationships and serve a variety of data management tasks, such as data linkage, query optimization, and data integration. The discovery of inclusion dependencies is, therefore, a well-studied problem and has been addressed by many algorithms. Each of these discovery algorithms follows its own strategy with certain strengths and weaknesses, which makes it difficult for data scientists to choose the optimal algorithm for a given profiling task.
Falco Dürsch, Axel Stebner, Fabian Windheuser, Maxi Fischer, Tim Friedrich, Nils Strelow, Tobias Bleifuß, Hazar Harmouch, Lan Jiang 0001, Thorsten Papenbrock, Felix Naumann
CIKM9