Database Paper Browser

Back to papers

Efficient Matrix Sketching over Distributed Data

Summary: Tight deterministic lower bound on communication for covariance sketches (||A^T A - B^T B||_2) in the s-server distributed model, proving a deterministic vs randomized gap. Randomized one-pass, low-space protocols bypass the bound to cut communication and improve distributed PCA. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1731
Venue
PODS
Year
2017
Pagerank
4.613363e-05
Overall Rank
7,949 | 44.71%
DOI
10.1145/3034786.3056119

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 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
402 Mergeable Summaries 2012 PODS 0.00024196343
1,411 Communication Steps for Parallel Query Processing 2013 PODS 0.0001212565
2,212 Skew in Parallel Query Processing 2014 PODS 9.2771827e-05
5,902 The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication 2015 PODS 5.2796864e-05
5,984 Streaming Anomaly Detection Using Randomized Matrix Sketching 2016 VLDB 5.244512e-05
6,602 Continuous Matrix Approximation on Distributed Data 2014 VLDB 4.9971153e-05
6,774 Matrix Sketching Over Sliding Windows 2016 SIGMOD 4.9299348e-05
Previous Page 1 / 1 Next

Semantically Similar Papers