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
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,879 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8575676e-05 |
| 5,200 | SetSketch: Filling the Gap between MinHash and HyperLogLog | 2021 | VLDB | 5.6337581e-05 |
| 6,244 | Approximate Distinct Counts for Billions of Datasets | 2019 | SIGMOD | 5.139669e-05 |
| 6,889 | Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond | 2023 | PODS | 4.893581e-05 |
| 7,709 | UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting | 2024 | VLDB | 4.6720658e-05 |
| 8,470 | Sampling Big Ideas in Query Optimization | 2023 | PODS | 4.5038423e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 9,918 | Shared Load(ing): Efficient Bulk Loading into Optimized Storage | 2020 | CIDR | 4.2561557e-05 |
| 11,835 | An Efficient MapReduce Cube Algorithm for Varied Data Distributions | 2016 | SIGMOD | 4.1945683e-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 |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019005923 |
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 383 | An Optimal Algorithm for the Distinct Elements Problem | 2010 | PODS | 0.00024820873 |
| 3,928 | Tighter Estimation using Bottom-k Sketches | 2008 | VLDB | 6.6254568e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,850 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD | 4.6362484e-05 |
| 7,236 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB | 4.7932355e-05 |
| 2,437 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB | 8.8231651e-05 |
| 5,200 | SetSketch: Filling the Gap between MinHash and HyperLogLog | 2021 | VLDB | 5.6337581e-05 |
| 4,344 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 6.2744553e-05 |
| 9,368 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD | 4.3481263e-05 |
| 8,542 | Fully Dynamic Betweenness Centrality Maintenance on Massive Networks | 2016 | VLDB | 4.4937074e-05 |
| 7,031 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS | 4.8561505e-05 |
| 1,040 | Graph Sketches: Sparsification, Spanners, and Subgraphs | 2012 | PODS | 0.00014488943 |
| 6,244 | Approximate Distinct Counts for Billions of Datasets | 2019 | SIGMOD | 5.139669e-05 |