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
5135
Venue
SIGMOD
Year
2015
Pagerank
0.00010242826
Overall Rank
1,598 | 89.04%
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,613 When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks 2018 SIGMOD 0.00010216983
1,745 Querying Shortest Paths on Time Dependent Road Networks 2019 VLDB 9.861709e-05
2,555 Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks 2017 VLDB 8.4184379e-05
4,135 Minimal On-Road Time Route Scheduling on Time-Dependent Graphs 2017 VLDB 6.8814581e-05
4,498 Constrained Shortest Path Query in a Large Time-Dependent Graph 2019 VLDB 6.6613027e-05
4,786 Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks 2020 SIGMOD 6.5083151e-05
4,807 Diversified Top-k Route Planning in Road Network 2022 VLDB 6.4992836e-05
5,044 Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs 2021 VLDB 6.3883109e-05
7,322 DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs 2022 VLDB 5.644647e-05
7,372 Public Transport Planning: When Transit Network Connectivity Meets Commuting Demand 2021 SIGMOD 5.6312975e-05
9,364 FHL-Cube: Multi-Constraint Shortest Path Querying with Flexible Combination of Constraints 2022 VLDB 5.2798829e-05
10,424 ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks 2026 SIGMOD 5.093636e-05
10,683 Bursting Flow Query on Large Temporal Flow Networks 2025 SIGMOD 5.093636e-05
11,272 Efficient kNN Search in Public Transportation Networks 2024 VLDB 5.093636e-05
11,695 Towards Crowd-aware Indoor Path Planning 2021 VLDB 5.093636e-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
195 Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling 2013 SIGMOD 0.00025813775
1,123 Path Problems in Temporal Graphs 2014 VLDB 0.00012089975
2,020 Query and Update Efficient B+-Tree Based Indexing of Moving Objects 2004 VLDB 9.2983514e-05
Previous Page 1 / 1 Next

Semantically Similar Papers