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

Junwei Lan

dblp:379/5733 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—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 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
3 papers
Information retrieval · 40% Distributed and cloud data management · 20% Database system architecture and tuning · 20%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
text embedding
1.012026
ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval · ACL (1) 2026
Distributed and cloud data management
distributed database performance
1.012026
Lamba: A pretrained model for latency prediction over distributed databases · VLDB J. 2026
Information retrieval
document retrieval
1.012026
ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval · ACL (1) 2026
Information retrieval › document retrieval
reasoning-intensive retrieval
1.012026
ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval · ACL (1) 2026
Query processing and optimization
cardinality estimation
0.812024
PRICE: A Pretrained Model for Cross-Database Cardinality Estimation · Proc. VLDB Endow. 2024
Machine learning and data management
learned database components
0.212024
PRICE: A Pretrained Model for Cross-Database Cardinality Estimation · Proc. VLDB Endow. 2024

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

self-adaptive learning · 2.0data synthesis · 2.0pre-trained model · 1.0self-attention · 0.8pre-training · 0.8fine-tuning · 0.8
YearPublicationVenuePosition
2026 ReasonEmbed: Enhanced Text Embeddings for Reasoning-Intensive Document Retrieval
abstract
In this paper, we introduce ReasonEmbed, a novel text embedding model developed for reasoning-intensive document retrieval.Our work includes three key technical contributions.First, we propose ReMixer, a new data synthesis method that overcomes the triviality problem prevalent in previous synthetic datasets, enabling large-scale production of 82K highquality training samples.Second, we design Redapter, a self-adaptive learning algorithm that dynamically adjusts training each sample's weight based on its reasoning intensity.This allows the model to effectively capture the complex semantic relationships between queries and documents.Third, we implement Rea-sonEmbed across multiple backbones of varying sizes, all of which achieve superior performance on reasoning-intensive retrieval tasks.Notably, our ReasonEmbed-Qwen3-8B model offers a record-high nDCG@10 score of 38.1 on the BRIGHT benchmark (SU et al., 2025), which significantly outperforms existing text embedding models.We will fully open-source our created resources in ReasonEmbed to push forward the research advancement in this field 1 .
Jianlyu Chen, Junwei Lan, Defu Lian, Zheng Liu 0011
ACL (1)2
2026 Lamba: A pretrained model for latency prediction over distributed databases
Yingli Zhou, Tianjing Zeng, Yingze Li, Junwei Lan, Zhewei Wei, Yixiang Fang, Bolin Ding, Jingren Zhou 0001
VLDB J.5
2024 PRICE: A Pretrained Model for Cross-Database Cardinality Estimation
abstract
Cardinality estimation (CardEst) is essential for optimizing query execution plans. Recent ML-based CardEst methods achieve high accuracy but face deployment challenges due to high preparation costs and lack of transferability across databases. In this paper, we propose PRICE, a PRetrained multI-table CardEst model, which addresses these limitations. PRICE takes low-level but transferable features w.r.t. data distributions and query information and elegantly applies self-attention models to learn meta-knowledge to compute cardinality in any database. It is generally and adaptively applicable to any unseen new database to attain high estimation accuracy, while its preparation cost is as little as the basic one-dimensional histogram-based CardEst methods. Moreover, PRICE can be finetuned to further enhance its performance on any specific database. We pretrained PRICE using 30 diverse datasets, completing the process in about 5 hours with a resulting model size of only about 40MB. Evaluations show that PRICE consistently outperforms existing methods, achieving the highest estimation accuracy on several unseen databases and generating faster execution plans with lower overhead. After finetuning with a small volume of database-specific queries, PRICE could even find plans that were very close to the optimal ones. Meanwhile, PRICE is generally applicable to different settings such as data updates, data scaling, and query workload shifts.
Tianjing Zeng, Junwei Lan, Jiahong Ma, Wenqing Wei, Pengfei Li 0005, Bolin Ding, Defu Lian, Zhewei Wei, Jingren Zhou 0001
Proc. VLDB Endow.2