Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
Summary: Introduces Query-by-Sketch (QbS) for exact shortest-path-graph queries on massive networks, using offline labels to guide online sketch. Proves correctness/complexity; 12 datasets (up to 1.7B vertices, 7.8B edges) yield microseconds on million-scale and sub-second on billion-scale. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ye Wang (Australian National University)
- 2. Qing Wang (Australian National University)
- 3. Henning Koehler (Massey University)
- 4. Yu Lin (Australian National University)
BibTeX Citation
@inproceedings{wang_sigmod21,
title = {{Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks}},
author = {Wang, Ye and Wang, Qing and Koehler, Henning and Lin, Yu},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452826},
url = {https://dl.acm.org/doi/10.1145/3448016.3452826},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,803 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB | 5.9893561e-05 |
| 6,526 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 5.7559739e-05 |
| 7,302 | BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale | 2022 | SIGMOD | 5.5602499e-05 |
| 8,788 | Towards Generating Hop-constrained s-t Simple Path Graphs | 2023 | SIGMOD | 5.2767294e-05 |
| 10,255 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 5.050482e-05 |
| 11,243 | Quantum Data Management in the NISQ Era | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025584127 |
| 382 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019485934 |
| 953 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00012877507 |
| 990 | Path Oracles for Spatial Networks | 2009 | VLDB | 0.00012648672 |
| 1,647 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 9.9875545e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,413 | The shortest path is not always a straight line: Leveraging semi-metricity in graph analysis | 2016 | VLDB |
| 2 | 6,177 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 3 | 2,420 | gSketch: On Query Estimation in Graph Streams | 2012 | VLDB |
| 4 | 9,805 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 5 | 774 | Efficiently Answering Reachability Queries on Very Large Directed Graphs | 2008 | SIGMOD |
| 6 | 4,551 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 7 | 5,803 | Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement | 2022 | VLDB |
| 8 | 197 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD |
| 9 | 7,351 | Toward a Distance Oracle for Billion-Node Graphs | 2014 | VLDB |
| 10 | 355 | On Graph Query Optimization in Large Networks | 2010 | VLDB |