Database Paper Browser

Back to papers

Optimal Approximate Matrix Multiplication over Sliding Windows

Summary: SO-COD: sliding-window AMM that tracks frequency-estimation style “snapshots” of incoming columns to maintain X Y^T with efficient updates. Provable optimal space O((d_x+d_y)/ε) (normalized) and O(((d_x+d_y)/ε)·log R) (unnormalized), matching lower bounds and offering faster queries. (summarized by gpt-5-mini on Mar 13 2026)

Paper ID
14332
Venue
VLDB
Year
2026
Pagerank
4.613363e-05
Overall Rank
7,929 | 44.84%
DOI
10.14778/3778092.3778105

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 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