Database Paper Browser

Back to papers

Optimal Matrix Sketching over Sliding Windows

Summary: Presents DS-FD, a matrix-sketching algorithm that attains the optimal O(d/ε) space bound for sliding-window streams (row-normalized, sequence-based), preserving FrequentDirections-style covariance guarantees. Proves matching upper/lower bounds for time-based and unnormalized windows, resolving the open question on optimal sliding-window space and validating performance empirically. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13448
Venue
VLDB
Year
2024
Pagerank
4.3674946e-05
Overall Rank
9,217 | 35.95%
DOI
10.14778/3665844.3665847

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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
846 Approximate Counts and Quantiles over Sliding Windows 2004 PODS 0.00015949293
2,766 A Simpler and More Efficient Deterministic Scheme for Finding Frequent Items over Sliding Windows 2006 PODS 8.1559016e-05
5,910 At-the-time and Back-in-time Persistent Sketches 2021 SIGMOD 5.2718714e-05
6,775 Matrix Sketching Over Sliding Windows 2016 SIGMOD 4.9252038e-05
Previous Page 1 / 1 Next

Semantically Similar Papers