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

Haixin Lin

dblp:319/2952 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-4237-5524ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › indexing › index compression
index pruning
0.712023
Optimizing Guided Traversal for Fast Learned Sparse Retrieval · WWW 2023
Information retrieval › retrieval models › sparse retrieval
learned sparse retrieval
0.712023
Optimizing Guided Traversal for Fast Learned Sparse Retrieval · WWW 2023
Information retrieval
retrieval models
0.712023
Optimizing Guided Traversal for Fast Learned Sparse Retrieval · WWW 2023

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

two-level pruning · 0.7model alignment · 0.7BM25-guided traversal · 0.7
YearPublicationVenuePosition
2023 Optimizing Guided Traversal for Fast Learned Sparse Retrieval
abstract
Recent studies show that BM25-driven dynamic index skipping can greatly accelerate MaxScore-based document retrieval based on the learned sparse representation derived by DeepImpact. This paper investigates the effectiveness of such a traversal guidance strategy during top k retrieval when using other models such as SPLADE and uniCOIL, and finds that unconstrained BM25-driven skipping could have a visible relevance degradation when the BM25 model is not well aligned with a learned weight model or when retrieval depth k is small. This paper generalizes the previous work and optimizes the BM25 guided index traversal with a two-level pruning control scheme and model alignment for fast retrieval using a sparse representation. Although there can be a cost of increased latency, the proposed scheme is much faster than the original MaxScore method without BM25 guidance while retaining the relevance effectiveness. This paper analyzes the competitiveness of this two-level pruning scheme, and evaluates its tradeoff in ranking relevance and time efficiency when searching several test datasets.
Yifan Qiao 0001, Yingrui Yang, Haixin Lin, Tao Yang 0009
WWW3