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

Lan Jiang 0001

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

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

Databases, data management, data science and information retrieval · 8 · 3 first-author · 6 since 2021Artificial intelligence and machine learning · 3 · 1 first-author

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
Data integration and cleaning · 65% Database system architecture and tuning · 35%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
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.212023
Pollock: A Data Loading Benchmark · Proc. VLDB Endow. 2023

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

graph-based layout similarity · 1.1graph comparison · 0.5clustering · 0.5
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
2016 Biterm Pseudo Document Topic Model for Short Text
abstract
In the past few years, we have witnessed a rapid development of online social media, from which we can access various short texts. Understanding the topic patterns of these short text is significant. Traditional topic models, like LDA, are not suitable when applied to short text topic analysis due to data sparsity. A lot of efforts have been made to solve this problem. However, there is still significant space to improve the effectiveness of these short text specific methods. In this paper, we proposed a novel word co-occurrence network based method, referred to as biterm pseudo document topic model (BPDTM), which extended the previous biterm topic model(BTM) for short text. We utilized the word co-occurrence network to construct biterm pseudo documents. The proposed model is promising since it represents words with their semantic adjacent biterms and is able to model the corpus-level semantic relation between two words. Besides, BPDTM naturally lengthens the documents, which alleviate the influence for performance exerted by data sparsity. Experiments demonstrated that our model outperformed two baselines, i.e. LDA and BTM, which proved its effectiveness on short text topic modeling task.
Lan Jiang 0001, Hengyang Lu, Ming Xu 0014, Chong-Jun Wang
ICTAI1
2014 Multi-label Emotion Classification for Tweets in Weibo: Method and Application
abstract
The booming development of Online Social Networks (OSNs) provides a novel way of expressing emotions. Research on emotion analysis for tweets in OSNs is becoming increasingly popular in recent years. Traditional emotion analysis only classifies one tweet into a single emotion category. However, in reality, a tweet may belong to several different emotion categories. In the paper, our goal is to predict all emotion labels of each tweet. We use graphic emoticons, punctuation expressions together with a tiny but accurate lexicon to label data and provide a Multi-label Emotion Classification algorithm (MEC) for tweets in Weibo (so called Chinese Twitter). Our method has superior performance to the state-of-the-art method under both single-label and multi-label evaluation measures. We also carried out a case study on Weibo dataset of Malaysia Missing Flight. We came to several meaningful conclusions such as "The outbreak of Anger has a delay after breaking point of Sadness".
Jun Yang 0038, Lan Jiang 0001, Chong-Jun Wang, Junyuan Xie
ICTAI2