Toward a Distance Oracle for Billion-Node Graphs
Summary: Proposes scalable distance oracles for graphs with billions of nodes using sketch-based encodings. Optimizes landmark selection, distributed BFS, and answer generation to balance space, speed, and accuracy; validated on real and synthetic networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zichao Qi
- 2. Yanghua Xiao
- 3. Bin Shao
- 4. Haixun Wang
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,129 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.5008242e-05 |
| 6,494 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.0417258e-05 |
| 8,885 | Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach | 2015 | VLDB | 4.4282232e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 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 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,923 | k-Clustering with Comparison and Distance Oracles | 2024 | PODS | 4.1945683e-05 |
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |
| 4,067 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 6.4795399e-05 |
| 945 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00015137526 |
| 5,250 | Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks | 2020 | SIGMOD | 5.6044961e-05 |
| 3,671 | Simple, Fast, and Scalable Reachability Oracle | 2013 | VLDB | 6.8560247e-05 |
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030040036 |
| 8,505 | Top-K Nearest Keyword Search on Large Graphs | 2013 | VLDB | 4.4958064e-05 |
| 11,376 | Succinct Graph Representations as Distance Oracles: An Experimental Evaluation | 2022 | VLDB | 4.1945683e-05 |
| 6,138 | Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks | 2021 | SIGMOD | 5.1915368e-05 |