SCOUT: Coupling-Free Bounds for Trillion-Scale Top-k Retrieval in Sparse Tensor Factorization
Summary: SCOUT enables top-k retrieval over trillion-scale implicit tensor spaces by reparameterizing tensor-factorization scores into coupling-free product-form bounds for admissible pruning and ranked access. Its N-dimensional best-first search supports anytime or certified exact results, achieving >10³× speedups over enumeration. (summarized by gpt-6-luna on Oct 22 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Jun-Gi Jang (Daegu Gyeongbuk Institute of Science and Technology)
- 2. Hyunsik Yoo (University of Illinois Urbana-Champaign)
- 3. Ruizhong Qiu (University of Illinois Urbana-Champaign)
- 4. Yinglong Xia (Meta)
- 5. Hanghang Tong (University of Illinois Urbana-Champaign)
BibTeX Citation
@inproceedings{jang_sigmod27,
title = {{SCOUT: Coupling-Free Bounds for Trillion-Scale Top-k Retrieval in Sparse Tensor Factorization}},
author = {Jang, Jun-Gi and Yoo, Hyunsik and Qiu, Ruizhong and Xia, Yinglong and Tong, Hanghang},
series = {{SIGMOD} '27},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3837123},
url = {https://dl.acm.org/doi/10.1145/3837123},
year = {2027}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010688884 |
| 170 | Combining Fuzzy Information from Multiple Systems | 1996 | PODS | 0.0002707332 |
| 505 | Supporting Top-k Join Queries in Relational Databases | 2003 | VLDB | 0.00017162373 |
| 2,293 | FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems | 2017 | SIGMOD | 8.6780858e-05 |
| 3,254 | LEMP: Fast Retrieval of Large Entries in a Matrix Product | 2015 | SIGMOD | 7.4748207e-05 |
| 6,935 | LFTF: A Framework for Efficient Tensor Analytics at Scale | 2017 | VLDB | 5.6248915e-05 |
| 11,711 | TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges | 2024 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,019 | IO-Top-k: Index-access Optimized Top-k Query Processing | 2006 | VLDB |
| 2 | 6,997 | A Scalable Index for Top-k Subtree Similarity Queries | 2019 | SIGMOD |
| 3 | 12,329 | Scout: A GPU-Aware System for Interactive Spatio-temporal Data Visualization | 2017 | SIGMOD |
| 4 | 12,833 | Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval | 2009 | SIGMOD |
| 5 | 7,413 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 6 | 4,735 | Maximum Inner Product is Query-Scaled Nearest Neighbor | 2025 | VLDB |
| 7 | 12,671 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB |
| 8 | 8,473 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 9 | 11,245 | Approximating Opaque Top-k Queries | 2025 | SIGMOD |
| 10 | 5,823 | SCOUT: Prefetching for Latent Structure Following Queries | 2012 | VLDB |