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

Yuanhao Zhong

dblp:352/8283 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 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 · 2 · 2 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 · 61% Data mining · 30% Machine learning and data management · 9%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Data mining › text mining › information extraction
attribute extraction
0.912025
Doctopus: Budget-aware Structural Table Extraction from Unstructured Documents · Proc. VLDB Endow. 2025
Query processing and optimization
query optimization
0.912025
DocDB: A Database for Unstructured Document Analysis · Proc. VLDB Endow. 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
attribute extraction
0.312025
DocDB: A Database for Unstructured Document Analysis · Proc. VLDB Endow. 2025
Machine learning and data management
data management for machine learning
0.312025
Doctopus: Budget-aware Structural Table Extraction from Unstructured Documents · Proc. VLDB Endow. 2025

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

large language model · 2.6two-level index · 1.7adaptive execution · 1.7pre-trained language model · 0.9budget-aware optimization · 0.9
YearPublicationVenuePosition
2025 Doctopus: Budget-aware Structural Table Extraction from Unstructured Documents
abstract
To fulfill the potential great value of unstructured documents, it is critical to extract structural data (e.g., attributes) from them, which can benefit various applications such as analytical SQL queries and decision-making. Multiple strategies, such as pre-trained language models (PLMs), can be employed for this task. However, these methods often struggle to achieve high-quality results, particularly when dealing with attribute extraction that requires intricate reasoning or semantic comprehension. Recently, large language models (LLMs) have proven to be effective in extracting attributes but incur substantial costs caused by token consumption, making them impractical for large-scale document set. To best trade off quality and cost, we present Doctopus, a system designed for accurate attribute extraction from unstructured documents with a user-specified cost constraint. Overall, Doctopus combines LLMs with non-LLM strategies to achieve a good tradeoff. First, the system employs an index-based approach to efficiently identify and process only relevant text chunks, thereby reducing the LLM cost. Afterwards, it further estimates the quality of multiple strategies for each attribute. Finally, based on the cost and estimated quality, Doctopus dynamically selects the optimal strategies through budget-aware optimization. We have built a comprehensive benchmark including 4 document sets with various characteristics and manually labeled ground truth using 1000 human hours. Extensive experiments on the benchmark show that compared with state-of-the-art baselines, Doctopus can improve the quality by 11% given the same cost constraint.
Chengliang Chai, Yuanhao Zhong, Ye Yuan 0001, Guoren Wang, Lei Cao 0004
Proc. VLDB Endow.4
2025 DocDB: A Database for Unstructured Document Analysis
abstract
Recent studies have developed LLM-powered data systems that enable database-like analysis of unstructured text documents. While LLMs excel at attribute extraction from documents, their high computational costs and latency make extraction operations the primary performance bottleneck. Existing systems typically adopt traditional relational database query optimization strategies, which prove ineffective in minimizing LLM-related expenses. To fill this gap, we propose DocDB, a prototype system that features a bunch of novel optimization strategies designated to unstructured document analysis. First, we employ a two-level index to reduce LLM extraction costs by selectively retrieving and processing only text segments relevant to target attributes. Second, DocDB employs adaptive execution, generating document-specific plans to minimize LLM extraction frequency based on varying per-document attribute extraction costs. With a real-life scenario, we demonstrate that DocDB allows users to analyze unstructured documents accurately and affordably using SQL-like queries. The corresponding video is available at https://youtu.be/8yDIKOBHIOg.
Zequn Li 0007, Yuanhao Zhong, Chengliang Chai, Zhaoze Sun, Ye Yuan 0001, Guoren Wang, Lei Cao 0004
Proc. VLDB Endow.2