All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis
Summary: Unified exposition of All-Distances Sketches (ADS) plus Historic Inverse Probability (HIP) estimators for scalable, near-linear per-node sketching of massive graphs. HIP halves variance of prior neighborhood-size estimates, yields polynomial gains for broader queries, is unbiased/simple, and empirically outperforms HyperLogLog. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Edith Cohen (Microsoft)
BibTeX Citation
@inproceedings{cohen_pods14,
address = {New York, NY, USA},
series = {{PODS} '14},
title = {{All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis}},
url = {https://dl.acm.org/doi/10.1145/2594538.2594546},
doi = {10.1145/2594538.2594546},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Cohen, Edith},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,490 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.5755831e-05 |
| 5,987 | SetSketch: Filling the Gap between MinHash and HyperLogLog | 2021 | VLDB | 5.9231381e-05 |
| 6,124 | Approximate Distinct Counts for Billions of Datasets | 2019 | SIGMOD | 5.8769926e-05 |
| 7,055 | UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting | 2024 | VLDB | 5.6097402e-05 |
| 7,076 | Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond | 2023 | PODS | 5.6039139e-05 |
| 8,560 | Sampling Big Ideas in Query Optimization | 2023 | PODS | 5.3133806e-05 |
| 9,630 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 5.1469233e-05 |
| 10,272 | Shared Load(ing): Efficient Bulk Loading into Optimized Storage | 2020 | CIDR | 5.0469592e-05 |
| 12,337 | An Efficient MapReduce Cube Algorithm for Varied Data Distributions | 2016 | SIGMOD | 4.9769913e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012087459 |
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025572265 |
| 494 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00017379171 |
| 3,540 | Tighter Estimation using Bottom k Sketches | 2008 | VLDB | 7.2127867e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,354 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB |
| 2 | 2,421 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB |
| 3 | 5,987 | SetSketch: Filling the Gap between MinHash and HyperLogLog | 2021 | VLDB |
| 4 | 3,791 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 5 | 9,630 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |
| 6 | 8,917 | Fully Dynamic Betweenness Centrality Maintenance on Massive Networks | 2016 | VLDB |
| 7 | 10,454 | Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance | 2026 | SIGMOD |
| 8 | 4,848 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS |
| 9 | 1,170 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS |
| 10 | 6,124 | Approximate Distinct Counts for Billions of Datasets | 2019 | SIGMOD |