Planting Trees for scalable and efficient Canonical Hub Labeling
Summary: PLaNT constructs minimal canonical hub labels via embarrassingly parallel, dependency-free labeling, avoiding PLL’s sequential root order. Collaborative partitioning enables in-memory distributed labeling/querying on massive weighted graphs, with substantially smaller labels and up to 9.5× cluster speedup. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kartik Lakhotia (University of Southern California)
- 2. Rajgopal Kannan (U.S. Army Research Laboratory)
- 3. Qing Dong (University of Southern California)
- 4. Viktor Prasanna (University of Southern California)
BibTeX Citation
@article{lakhotia_vldb20,
title = {{Planting Trees for scalable and efficient Canonical Hub Labeling}},
author = {Lakhotia, Kartik and Kannan, Rajgopal and Dong, Qing and Prasanna, Viktor},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {4},
pages = {492--505},
doi = {10.14778/3372716.3372722},
url = {https://doi.org/10.14778/3372716.3372722},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,008 | An Experimental Evaluation and Guideline for Path Finding in Weighted Dynamic Network | 2021 | VLDB | 5.6061911e-05 |
| 7,752 | RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs | 2021 | VLDB | 5.4440674e-05 |
| 11,507 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 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.0012089097 |
| 111 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00032621499 |
| 192 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00025740385 |
| 376 | TEDI: Efficient Shortest Path Query Answering on Graphs | 2010 | SIGMOD | 0.00019655871 |
| 1,346 | An Experimental Study on Hub Labeling based Shortest Path Algorithms | 2018 | VLDB | 0.00010949128 |
| 1,440 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD | 0.00010630613 |
| 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB | 0.00010155939 |
| 1,653 | IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying | 2013 | VLDB | 9.9588776e-05 |
| 2,201 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD | 8.8626226e-05 |
| 2,242 | Efficient Network-Aware Search in Collaborative Tagging Sites | 2008 | VLDB | 8.7698066e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,236 | Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning | 2013 | VLDB |
| 2 | 1,046 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD |
| 3 | 6,192 | Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond | 2020 | VLDB |
| 4 | 1,577 | Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks | 2014 | VLDB |
| 5 | 4,214 | Scaling Up Distance Labeling on Graphs with Core-Periphery Properties | 2020 | SIGMOD |
| 6 | 11,634 | Distributed Shortest Distance Labeling on Large-Scale Graphs | 2024 | VLDB |
| 7 | 11,507 | A CPU-GPU Hybrid Labelling Algorithm for Massive Shortest Distance Queries on Road Networks | 2025 | VLDB |
| 8 | 5,699 | Hub Labeling for Shortest Path Counting | 2020 | SIGMOD |
| 9 | 1,346 | An Experimental Study on Hub Labeling based Shortest Path Algorithms | 2018 | VLDB |
| 10 | 2,201 | Scaling Distance Labeling on Small-World Networks | 2019 | SIGMOD |