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

Qingyin Lin

dblp:411/2363 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0001-3692-4761ORCID · reported

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 2021Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
data management for machine learning
0.812024
IncrCP: Decomposing and Orchestrating Incremental Checkpoints for Effective Recommendation Model Training · Proc. VLDB Endow. 2024
Distributed systems › fault tolerance
checkpointing
0.812024
IncrCP: Decomposing and Orchestrating Incremental Checkpoints for Effective Recommendation Model Training · Proc. VLDB Endow. 2024
Distributed systems › fault tolerance › checkpointing
incremental checkpointing
0.812024
IncrCP: Decomposing and Orchestrating Incremental Checkpoints for Effective Recommendation Model Training · Proc. VLDB Endow. 2024

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

selective extraction · 1.5concatenation · 1.52-d chunk approach · 1.5
YearPublicationVenuePosition
2026 RecDB: An LSM-Tree based Storage System for Training Large Recommendation Model in Low-Resource Scenarios
Qingyin Lin, Zhitao Chen, Yunling Chen, Zhiguang Chen 0001
EDBT2
2025 DynoInfer: Adaptive Resource Orchestration for LLM Inference on Resource-Constrained PCs
Yunling Chen, Qingyin Lin, Zhitao Chen, Zhiguang Chen 0001
Euro-Par (1)2
2024 IncrCP: Decomposing and Orchestrating Incremental Checkpoints for Effective Recommendation Model Training
abstract
Training large models for modern recommendation systems requires a substantial number of computational devices and extended periods. Since it is essential to store model checkpoints throughout the training progress for accuracy debugging or mitigating potential failures, checkpointing systems are widely used. However, given that recommendation models can scale to hundreds of gigabytes or more, existing solutions often introduce significant overhead in terms of both storage and I/O. In this paper, we present IncrCP, a checkpointing system specifically designed for recommendation models. Given that only a small fraction of model parameters are modified in each iteration, IncrCP creatively leverages the incremental checkpointing strategy and overcomes the inherent slow recovery problem. To support recovering all states throughout the training process, while also ensuring efficient storage utilization and rapid recovery, IncrCP proposes the 2-D chunk approach. It proactively records changed parameters in the training process as well as their indexes, extracts parameters according to duplicated indexes as independent chunk files, and then orchestrates these chunks in the 2-dimensional linked list. In this way, IncrCP achieves fast recovery by loading less unnecessary parameters and performing less deduplication during recovery. Furthermore, IncrCP includes a selective extraction approach to reduce I/O by avoiding worthless extractions and a concatenate approach to reduce random disk access when recovery. Evaluations show that IncrCP achieves up to 6.6× recovery speedup compared to the naive incremental strategy and saves storage space by 60.4% with slight overhead compared to another recovery-friendly strategy.
Qingyin Lin, Jiangsu Du, Zhiguang Chen 0001, Nong Xiao 0001
Proc. VLDB Endow.1