Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
Summary: Weighted MinHash-based compact sketches for independent pairwise inner-product estimation, provably matching linear sketches on dense vectors and improving error bounds for sparse vectors with limited support overlap. Empirically outperforms CountSketch/JL and unweighted hashing, making it attractive for dataset-search and column-wise covariance/conditional-mean estimation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Aline Bessa (New York University)
- 2. Majid Daliri (New York University)
- 3. Juliana Freire (New York University)
- 4. Cameron Musco (University of Massachusetts Amherst)
- 5. Christopher Musco (New York University)
- 6. Aécio Santos (New York University)
- 7. Haoxiang Zhang (New York University)
BibTeX Citation
@inproceedings{bessa_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588679},
doi = {10.1145/3584372.3588679},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bessa, Aline and Daliri, Majid and Freire, Juliana and Musco, Cameron and Musco, Christopher and Santos, Aécio and Zhang, Haoxiang},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,421 | Sampling Methods for Inner Product Sketching | 2024 | VLDB | 5.3350162e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 20 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00057568153 |
| 428 | Tracking Join and Self-Join Sizes in Limited Storage | 1999 | PODS | 0.0001845349 |
| 494 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00017387321 |
| 694 | JOSIE: Overlap Set Similarity Search for Finding Joinable Tables in Data Lakes | 2019 | SIGMOD | 0.00014727089 |
| 707 | On Synopses for Distinct-Value Estimation Under Multiset Operations | 2007 | SIGMOD | 0.00014640173 |
| 1,318 | LSH Ensemble: Internet-Scale Domain Search | 2016 | VLDB | 0.00011047393 |
| 3,090 | Correlation Sketches for Approximate Join-Correlation Queries | 2021 | SIGMOD | 7.6584982e-05 |
| 3,858 | Is Min-Wise Hashing Optimal for Summarizing Set Intersection? | 2014 | PODS | 6.9676872e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,815 | Bias-Aware Sketches | 2017 | VLDB |
| 2 | 2,354 | Hashed Samples: Selectivity Estimators For Set Similarity Selection Queries | 2008 | VLDB |
| 3 | 5,910 | Active Sampling Count Sketch (ASCS) for Online Sparse Estimation of a Trillion Scale Covariance Matrix | 2021 | SIGMOD |
| 4 | 5,987 | SetSketch: Filling the Gap between MinHash and HyperLogLog | 2021 | VLDB |
| 5 | 3,514 | Sketching Linear Classifiers over Data Streams | 2018 | SIGMOD |
| 6 | 8,775 | Bidirectionally Densifying LSH Sketches with Empty Bins | 2021 | SIGMOD |
| 7 | 9,258 | Sketching via Hashing: From Heavy Hitters to Compressive Sensing to Sparse Fourier Transform | 2013 | PODS |
| 8 | 3,858 | Is Min-Wise Hashing Optimal for Summarizing Set Intersection? | 2014 | PODS |
| 9 | 8,035 | JoinSketch: A Sketch Algorithm for Accurate and Unbiased Inner-Product Estimation | 2023 | SIGMOD |
| 10 | 8,421 | Sampling Methods for Inner Product Sketching | 2024 | VLDB |