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

Qiyan Deng

dblp:375/9826 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0002-7797-5888ORCID · verified

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

Databases, data management, data science and information retrieval · 2 · 1 first-author · 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
1 paper
Query processing and optimization · 77% Information retrieval · 23%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization
cost-based optimization
0.912025
QUEST: Query Optimization in Unstructured Document Analysis · Proc. VLDB Endow. 2025
Information retrieval › document processing
document analysis
0.312025
QUEST: Query Optimization in Unstructured Document Analysis · Proc. VLDB Endow. 2025

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

large language model · 0.9index-based retrieval · 0.9evidence-augmented retrieval · 0.9
YearPublicationVenuePosition
2026 Unstructured Data Analysis using LLMs: A Comprehensive Benchmark
Qiyan Deng, Chengliang Chai, Ye Yuan 0001, Jinqi Liu, Junzhi She, Kaisen Jin, Zhaoze Sun, Jia Yuan, Guoren Wang, Lei Cao 0004
Proc. VLDB Endow.1
2025 QUEST: Query Optimization in Unstructured Document Analysis
abstract
Most recently, researchers have started building large language models (LLMs) powered data systems that allow users to analyze unstructured text documents like working with a database because LLMs are very effective in extracting attributes from documents. In such systems, LLM-based extraction operations constitute the performance bottleneck of query execution due to the high monetary cost and slow LLM inference. Existing systems typically borrow the query optimization principles popular in relational databases to produce query execution plans, which unfortunately are ineffective in minimizing LLM cost. To fill this gap, we propose QUEST, which features a bunch of novel optimization strategies for unstructured document analysis. First, we introduce an index-based strategy to minimize the cost of each extraction operation. With this index, QUEST quickly retrieves the text segments relevant to the target attributes and only feeds them to LLMs. Furthermore, we design an evidence-augmented retrieval strategy to reduce the possibility of missing relevant segments. Moreover, we develop an instance-optimized query execution strategy: because the attribute extraction cost could vary significantly document by document, QUEST produces different plans for different documents. For each document, QUEST produces a plan to minimize the frequency of attribute extraction. The innovations include LLM cost-aware operator ordering strategies and an optimized join execution approach that transforms joins into filters. Extensive experiments on 3 real-world datasets demonstrate the superiority of QUEST, achieving 30%-6× cost savings while improving the F1 score by 10% -27% compared with state-of-the-art baselines.
Zhaoze Sun, Chengliang Chai, Qiyan Deng, Kaisen Jin, Ye Yuan 0001, Guoren Wang, Lei Cao 0004
Proc. VLDB Endow.3