Zitong Chen
ABSTRACT
The most efficient known approach for shortest distance querying on road networks is via a tree decomposition based 2-hop labeling index. A major challenge here is how to reduce the query time by reducing the label size. To this end, we propose P2H with the novel ideas of projected vertex separators and optimized selection of vertex separators. We also introduce mechanisms for index maintenance for edge weight updating. Our experiments on multiple real road networks show that P2H can greatly reduce the effective label sizes and query time over existing algorithms. For larger datasets, P2H is around twice as efficient as the best known algorithm.
Supplemental Material
- Ittai Abraham, Daniel Delling, Andrew V Goldberg, and Renato F Werneck. 2011. A Hub-based Labeling Algorithm for Shortest Paths in Road Networks. In Proceedings of the International Symposium on Experimental Algorithms. 230--241.Google Scholar
Cross Ref
- Ittai Abraham, Daniel Delling, Andrew V Goldberg, and Renato F Werneck. 2012. Hierarchical Hub Labelings for Shortest Paths. In Proceedings of the European Symposium on Algorithms. 24--35.Google ScholarDigital Library
- Takuya Akiba, Yoichi Iwata, Ken-ichi Kawarabayashi, and Yuki Kawata. 2014. Fast Shortest-Path Distance Queries on Road Networks by Pruned Highway Labeling. In Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments. 147--154.Google ScholarCross Ref
- Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2013. Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 349--360.Google ScholarDigital Library
- Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route Planning in Transportation Networks. Algorithm Engineering, 19--80.Google Scholar
- Holger Bast, Stefan Funke, and Domagoj Matijevic. 2009. Ultrafast Shortest-Path Queries via Transit Nodes. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 74, 175--192.Google ScholarCross Ref
- Michael A. Bender and Martin Farach-Colton. 2000. The LCA Problem Revisited. In Proceedings of the Latin American Symposium on Theoretical Informatics. 88--94.Google Scholar
- Hans L Bodlaender and Arie MCA Koster. 2010. Treewidth Computations I. Upper Bounds. Information and Computation, Vol. 208, 3, 259--275.Google ScholarDigital Library
- Lijun Chang, Jeffrey Xu Yu, Lu Qin, Hong Cheng, and Miao Qiao. 2012. The Exact Distance to Destination in Undirected World. The International Journal on Very Large Data Bases, Vol. 21, 6, 869--888.Google ScholarDigital Library
- Shvia Chaudhuri and Christos D. Zaroliagis. 2000. Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms. Algorithmica, Vol. 27, 3, 212--226.Google ScholarCross Ref
- James Cheng, Yiping Ke, Shumo Chu, and Carter Cheng. 2012. Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 457--468.Google ScholarDigital Library
- Jiefeng Cheng and Jeffrey Xu Yu. 2009. On-line Exact Shortest Distance Query Processing. In Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology. 481--492.Google ScholarDigital Library
- Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. 2002. Reachability and Distance Queries via 2-hop Labels. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 937--946.Google Scholar
- Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy. 2010. R: A Sketch based Distance Oracle for Web-Scale Graphs. In Proceedings of the International Conference on Web Search and Data Mining. 401--410.Google ScholarDigital Library
- Edsger Wybe Dijkstra. 1959. A Note on Two problems in Connexion with Graphs. Numer. Math., Vol. 1, 1, 269--271.Google ScholarDigital Library
- Ada Wai-Chee Fu, Huanhuan Wu, James Cheng, and Raymond Chi-Wing Wong. 2013. Is-Label: An Independent-Set based Labeling Scheme for Point-to-point Distance Querying. Proceedings of the VLDB Endowment, Vol. 6, 6, 457--468.Google ScholarDigital Library
- Cyril Gavoille, David Peleg, Stephane Perennes, and Ran Raz. 2001. Distance Labeling in Graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 210--219.Google Scholar
- Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. 2008. Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In Proceedings of the International Workshop on Experimental and Efficient Algorithms. 319--333.Google ScholarCross Ref
- Andrew V Goldberg and Chris Harrelson. 2005. Computing the Shortest Path: A Search Meets Graph Theory. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 156--165.Google Scholar
- Ronald J Gutman. 2004. Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. Algorithm Engineering and Experimentation, Vol. 4, 100--111.Google Scholar
- Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, Vol. 4, 2, 100--107.Google ScholarCross Ref
- Minhao Jiang, Ada Wai-Chee Fu, Raymond Chi-Wing Wong, and Yanyan Xu. 2014. Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks. Proceedings of the VLDB Endowment, Vol. 7, 12, 1203--1214.Google ScholarDigital Library
- Vasiliki Kalavri, Tiago Simas, and Dionysios Logothetis. 2016. The Shortest Path is Not Always a Straight Line. Proceedings of the VLDB Endowment, Vol. 9, 9, 672--683.Google ScholarDigital Library
- Lei Li, Mengxuan Zhang, Wen Hua, and Xiaofang Zhou. 2020. Fast Query Decomposition for Batch Shortest Path Processing in Road Networks. In Proceedings of the International Conference on Data Engineering. 1189--1200.Google ScholarCross Ref
- Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, and Xuemin Lin. 2019. Scaling Distance Labeling on Small-World Networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 1060--1077.Google ScholarDigital Library
- Ye Li, Leong Hou U, Man Lung Yiu, and Ngai Meng Kou. 2017. An Experimental Study on Hub Labeling based Shortest Path Algorithms. Proceedings of the VLDB Endowment, Vol. 11, 4, 445--457.Google ScholarDigital Library
- Jens Maue, Peter Sanders, and Domagoj Matijevic. 2006. Goal Directed Shortest Path Queries using Precomputed Cluster Distances. In Proceedings of the International Workshop on Experimental and Efficient Algorithms. 316--327.Google ScholarDigital Library
- Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, and Qing Zhu. 2018. When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 709--724.Google ScholarDigital Library
- Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, and Xuemin Lin. 2020. Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proceedings of the VLDB Endowment, Vol. 13, 5, 602--615.Google ScholarDigital Library
- David Peleg. 2000. Proximity-Preserving Labeling Schemes. Journal of Graph Theory, Vol. 33, 167--176.Google ScholarDigital Library
- Peter Sanders and Dominik Schultes. 2005. Highway Hierarchies Hasten Exact Shortest Path Queries. In Proceedings of the European Symposium on Algorithms. 568--579.Google ScholarDigital Library
- Ralf Schenkel, Anja Theobald, and Gerhard Weikum. 2005. Efficient Creation and Incremental Maintenance of the Hopi Index for Complex XML Document Collections. In Proceedings of the International Conference on Data Engineering. 360--371.Google ScholarDigital Library
- Ralf Schenkel, Anja Theobald, Gerhard Weikum, Elisa Bertino, and Elena Ferrari. 2004. Hopi: An Efficient Connection Index for Complex XML Document Collections. In Proceedings of the International Conference on Extending Database Technology. 237--255.Google ScholarCross Ref
- Christian. Sommer, Elad. Verbin, and Wei Yu. 2009. Distance Oracle for Sparse Graphs. In Proceedings of the IEEE Symposium on Foundations of Computer Science. 703--712.Google Scholar
- Mikkel Thorup and Uri Zwick. 2001. Approximate Distance Oracles. In Proceedings of the ACM Symposium on Theory of Computing. 183--192.Google ScholarDigital Library
- Yong Wang, Guoliang Li, and Nan Tang. 2019. Querying Shortest Paths on Time Dependent Road Networks. Proceedings of the VLDB Endowment, Vol. 12, 11, 1249--1261.Google ScholarDigital Library
- Fang Wei. 2012. TEDI: efficient shortest path query answering on graphs. In Proceedings of the ACM SIGMOD International Conference on Management of data. 99--110.Google ScholarCross Ref
- Yanghua Xiao, Wentao Wu, Jian Pei, Wei Wang, and Zhenying He. 2009. Efficiently Indexing Shortest Paths by Exploiting Symmetry in Graphs. In Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology. 493--504.Google ScholarDigital Library
- Dongxiang Zhang, Dingyu Yang, Yuan Wang, Kian Lee Tan, Jian Cao, and Heng Tao Shen. 2017. Distributed Shortest Path Query Processing on Dynamic Road Networks. Proceedings of the VLDB Endowment, Vol. 26, 3, 399--419.Google Scholar
- Mengxuan Zhang, Lei Li, Wen Hua, and Xiaofang Zhou. 2019 a. Batch Processing of Shortest Path Queries in Road Networks. In Proceedings of the Australasian Database Conference. 3--16.Google ScholarDigital Library
- Mengxuan Zhang, Lei Li, Wen Hua, and Xiaofang Zhou. 2019 b. Efficient Batch Processing of Shortest Path Queries in Road Networks. In Proceedings of the International Conference on Mobile Data Management. 100--105.Google ScholarCross Ref
- Andy Diwen Zhu, Xiaokui Xiao, Sibo Wang, and Wenqing Lin. 2013. Efficient Single-Source Shortest Path and Distance Queries on Large Graphs. In Proceedings of the International Conference on Knowledge Discovery and Data Mining. 998--1006.Google ScholarDigital Library
Index Terms
- P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators
Recommendations
On minimal vertex separators of dually chordal graphs: Properties and characterizations
Many works related to dually chordal graphs, their cliques and neighborhoods were published by Brandstadt et al. (1998) [1] and Gutierrez (1996) [6]. We will undertake a similar study by considering minimal vertex separators and their properties ...
Bimagic Vertex Labelings
The notion of the equivalence of vertex labelings on a given graph is introduced. The equivalence of three bimagic labelings for regular graphs is proved. A particular solution is obtained for the problem of the existence of a 1-vertex bimagic vertex ...
2-Distance vertex-distinguishing index of subcubic graphs
A 2-distance vertex-distinguishing edge coloring of a graph G is a proper edge coloring of G such that any pair of vertices at distance 2 have distinct sets of colors. The 2-distance vertex-distinguishing index $$\chi ^{\prime }_{\mathrm{d2}}(G)$$?d2?(G)...
Comments