Optimal Matrix Sketching over Sliding Windows
Summary: Introduces DS-FD, resolving the open question of optimal matrix sketching on sliding windows with O(d/ε) space for row-normalized streams. Matching upper/lower bounds cover time-based and unnormalized windows, establishing broad optimality. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hanyan Yin (Renmin University of China)
- 2. Dongxie Wen (Renmin University of China)
- 3. Jiajun Li (Renmin University of China)
- 4. Zhewei Wei (Renmin University of China)
- 5. Xiao Zhang (Renmin University of China)
- 6. Zengfeng Huang (Fudan University)
- 7. Feifei Li (Alibaba)
BibTeX Citation
@article{yin_vldb24,
title = {{Optimal Matrix Sketching over Sliding Windows}},
author = {Yin, Hanyan and Wen, Dongxie and Li, Jiajun and Wei, Zhewei and Zhang, Xiao and Huang, Zengfeng and Li, Feifei},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {9},
pages = {2149--2161},
doi = {10.14778/3665844.3665847},
url = {https://doi.org/10.14778/3665844.3665847},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,415 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB | 5.3350162e-05 |
| 10,616 | AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams | 2026 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 710 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS | 0.00014608975 |
| 2,875 | A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows | 2006 | PODS | 7.9193665e-05 |
| 5,373 | At-the-time and Back-in-time Persistent Sketches | 2021 | SIGMOD | 6.1569337e-05 |
| 6,832 | Matrix Sketching Over Sliding Windows | 2016 | SIGMOD | 5.6684547e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,957 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS |
| 2 | 710 | Approximate Counts and Quantiles over Sliding Windows | 2004 | PODS |
| 3 | 3,702 | Identifying Representative Trends in Massive Time Series Data Sets Using Sketches | 2000 | VLDB |
| 4 | 6,066 | Streaming Anomaly Detection Using Randomized Matrix Sketching | 2016 | VLDB |
| 5 | 7,870 | Sketch-based Querying of Distributed Sliding-Window Data Streams | 2012 | VLDB |
| 6 | 8,434 | Efficient Matrix Sketching over Distributed Data | 2017 | PODS |
| 7 | 12,919 | Variance Estimation over Sliding Windows | 2007 | PODS |
| 8 | 10,616 | AeroSketch: Near-Optimal Time Matrix Sketch Framework for Persistent, Sliding Window, and Distributed Streams | 2026 | SIGMOD |
| 9 | 8,415 | Optimal Approximate Matrix Multiplication over Sliding Windows | 2026 | VLDB |
| 10 | 6,832 | Matrix Sketching Over Sliding Windows | 2016 | SIGMOD |