DBScholar

Back to papers

Efficient Route Planning on Public Transportation Networks: A Labelling Approach

Summary: TTL is a label-based index for timetable graphs, where each node stores labels for the shortest travel time to other nodes given a departure time. It supports three query types, uses preprocessing and label compression to trim space, and real-data experiments show faster queries with moderate overhead. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hbb0163261142546d
Venue
SIGMOD
Year
2015
Pagerank
0.00010049301
Overall Rank
1,622 | 89.10%
DOI
10.1145/2723372.2749456

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wang_sigmod15,
        title = {{Efficient Route Planning on Public Transportation Networks: A Labelling Approach}},
        author = {Wang, Sibo and Lin, Wenqing and Yang, Yi and Xiao, Xiaokui and Zhou, Shuigeng},
        series = {{SIGMOD} '15},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2723372.2749456},
        url = {https://dl.acm.org/doi/10.1145/2723372.2749456},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Rank Citing Paper Year Venue Pagerank
1,645 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 9.9906562e-05
1,724 Querying Shortest Paths on Time Dependent Road Networks 2019 VLDB 9.7886535e-05
2,604 Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks 2017 VLDB 8.2286766e-05
4,175 Minimal On-Road Time Route Scheduling on Time-Dependent Graphs 2017 VLDB 6.7546329e-05
4,340 Constrained Shortest Path Query in a Large Time-Dependent Graph 2019 VLDB 6.6487196e-05
4,636 Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks 2020 SIGMOD 6.4902578e-05
4,907 Diversified Top-k Route Planning in Road Network 2022 VLDB 6.3586353e-05
5,004 Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs 2021 VLDB 6.3172422e-05
6,770 DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs 2022 VLDB 5.6845157e-05
7,520 Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand 2021 SIGMOD 5.5023404e-05
9,553 FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints 2022 VLDB 5.1589731e-05
10,624 ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks 2026 SIGMOD 4.9769913e-05
11,132 Bursting Flow Query on Large Temporal Flow Networks 2025 SIGMOD 4.9769913e-05
11,606 Efficient kNN Search in Public Transportation Networks 2024 VLDB 4.9769913e-05
12,006 Towards Crowd-aware Indoor Path Planning 2021 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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.00025572265
1,106 Path Problems in Temporal Graphs 2014 VLDB 0.0001199079
2,065 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 9.0904572e-05
Previous Page 1 / 1 Next

Semantically Similar Papers