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
13447
Venue
VLDB
Year
2024
Pagerank
4.3716847e-05
Overall Rank
9,215 | 35.90%
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.

Previous Page 1 / 1 Next

Semantically Similar Papers