Distributed Statistical Estimation of Matrix Products with Applications
Summary: Develops communication- and round-efficient protocols for estimating ℓp norms, distinct counts, ℓ0-samples, and heavy hitters of a distributed integer matrix product. Unifies these tasks with set-intersection and natural joins, including maximum-intersection search and uniform sampling. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. David P. Woodruff (Carnegie Mellon University)
- 2. Qin Zhang (Indiana University)
BibTeX Citation
@inproceedings{woodruff_pods18,
address = {New York, NY, USA},
series = {{PODS} '18},
title = {{Distributed Statistical Estimation of Matrix Products with Applications}},
url = {https://dl.acm.org/doi/10.1145/3196959.3196964},
doi = {10.1145/3196959.3196964},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Woodruff, David P. and Zhang, Qin},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 494 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00017387321 |
| 805 | Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems | 2011 | PODS | 0.00013794691 |
| 977 | Parallel Evaluation of Conjunctive Queries | 2011 | PODS | 0.00012731794 |
| 1,231 | Communication Steps for Parallel Query Processing | 2013 | PODS | 0.00011410373 |
| 1,481 | Skew in Parallel Query Processing | 2014 | PODS | 0.00010539119 |
| 2,043 | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | 2017 | PODS | 9.1406885e-05 |
| 2,464 | Output-optimal Parallel Algorithms for Similarity Joins | 2017 | PODS | 8.4260608e-05 |
| 3,809 | On the Complexity of Inner Product Similarity Join | 2016 | PODS | 7.0089846e-05 |
| 6,121 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS | 5.8800995e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,203 | Frequency Estimation under Local Differential Privacy | 2021 | VLDB |
| 2 | 3,967 | Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing | 1996 | VLDB |
| 3 | 8,836 | On the algebra of data sketches | 2021 | VLDB |
| 4 | 6,122 | Approximate Distinct Counts for Billions of Datasets | 2019 | SIGMOD |
| 5 | 9,890 | Sharing Aggregate Computation for Distributed Queries | 2007 | SIGMOD |
| 6 | 8,434 | Efficient Matrix Sketching over Distributed Data | 2017 | PODS |
| 7 | 5,654 | Distributed Set-Expression Cardinality Estimation | 2004 | VLDB |
| 8 | 6,833 | Continuous Matrix Approximation on Distributed Data | 2014 | VLDB |
| 9 | 7,259 | Submodularity of Distributed Join Computation | 2018 | SIGMOD |
| 10 | 6,121 | The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication | 2015 | PODS |