EDBT 2026 Demo / reviewers in the wild / expert
Chongyang Yan
dblp:397/8087
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0001-0722-7019ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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 |
Recommender systems · 33% Information retrieval · 33% Data stream processing · 33% | |
| Artificial intelligence
1 paper |
Efficient and distributed learning · 50% Representation and self-supervised learning · 50% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information retrieval
indexing |
0.9 | 1 | 2025 | Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever · KDD (2) 2025 |
Data stream processing › streaming data retrieval
stream indexing |
0.9 | 1 | 2025 | Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever · KDD (2) 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.3 | 1 | 2025 | Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever · KDD (2) 2025 |
Machine learning › Representation and self-supervised learning
vector quantization |
0.3 | 1 | 2025 | Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization Retriever · KDD (2) 2025 |
Methods — techniques the papers use, named apart from their topics
vector quantization · 1.7approximate nearest neighbor search · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Real-time Indexing for Large-scale Recommendation by Streaming Vector Quantization RetrieverabstractRetrievers, which form one of the most important recommendation stages, are responsible for efficiently selecting possible positive samples to the later stages under strict latency limitations. Because of this, large-scale systems always rely on approximate calculations and indexes to roughly shrink candidate scale, with a simple ranking model. Most of the existing methods mainly focus on incorporating complicated ranking models. However, index structure is not improved, which also bottlenecks the whole effectiveness. In this paper, we propose a novel index structure: streaming Vector Quantization model, as a new generation of retrieval paradigm. Streaming VQ attaches items with indexes in real time, granting it immediacy. Moreover, through meticulous verification of possible variants, it achieves additional benefits like index balancing and reparability, enabling it to support complicated ranking models as existing approaches. Streaming VQ has been deployed and replaced all major retrievers in Douyin and Douyin Lite, resulting in remarkable user engagement gain. Xingyan Bin, Jianfei Cui, Wujie Yan, Zhichen Zhao, Xintian Han, Chongyang Yan, Feng Zhang 0047, Zuotao Liu |
KDD (2) | 6 |