Abstract
Shortest distance queries not only find important applications in real-word systems, it is also the foundation for numerous other graph analysis problems. State-of-the-art techniques for such queries use 2-hop labeling, in particular, the Pruned Landmark Labeling (PLL) index is among the best performing for small world networks. However, PLL suffers from large label size and index computation time when the graph is large. In this paper, we propose two techniques to address the problem. The first technique is to limit the landmarks to vertices in a minimum vertex cover, and the second is to use a hybrid index by decomposing the graph into a core and a forest, and combining the PLL index for the core and a simpler distance labeling for trees. Extensive experiments with real-world graphs verified the effectiveness of these techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Or to use Dijkstra’s algorithm for weighted graphs.
- 2.
For most datasets, the time spent on finding the minimum vertex cover and core-forest decomposition is small compared with that of PLL. One exception in our experiments is the DBpedia, for which computing the vertex cover too significant amount of time.
References
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20662-7_20
Akiba, T., Iwata, Y., Kawarabayashi, K., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, 5 January 2014, pp. 147–154 (2014)
Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. Proc. ACM SIGMOD Int. Conf. Manag. Data 2013, 349–360 (2013)
Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26–July 01 2016, pp. 1199–1214 (2016)
Chang, L., Yu, J.X., Qin, L., Cheng, H., Qiao, M.: The exact distance to destination in undirected world. VLDB J. 21(6), 869–888 (2012). https://doi.org/10.1007/s00778-012-0274-x
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338–1355 (2003)
Delling, D.: Route planning in transportation networks: from research to practice. In: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2018, Seattle, WA, USA, 06–09 November 2018, p. 2. ACM (2018)
Fan, W., Li, J., Ma, S., Wang, H., Wu, Y.: Graph homomorphism revisited for graph matching. PVLDB 3(1), 1161–1172 (2010)
Farhan, M., Wang, Q., Lin, Y., McKay, B.D.: A highly scalable labelling approach for exact distance queries in complex networks. In: Advances in Database Technology - 22nd International Conference on Extending Database Technology, EDBT 2019, Lisbon, Portugal, 26–29 March 2019, pp. 13–24 (2019)
Fu, A.W., Wu, H., Cheng, J., Wong, R.C.: IS-LABEL: an independent-set based labeling scheme for point-to-point distance querying. PVLDB 6(6), 457–468 (2013)
Gubichev, A., Bedathur, S.J., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, pp. 499–508 (2010)
Haryanto, A.A., Islam, M.S., Taniar, D., Cheema, M.A.: Ig-tree: an efficient spatial keyword index for planning best path queries on road networks. World Wide Web 22(4), 1359–1399 (2019)
Hassan, M.S., Aref, W.G., Aly, A.M.: Graph indexing for shortest-path finding over dynamic sub-graphs. In: Özcan, F., Koutrika, G., Madden, S. (eds.) Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, June 26 - July 01 June 2016, pp. 1183–1197. ACM (2016)
Hayashi, T., Akiba, T., Kawarabayashi, K.: Fully dynamic shortest-path distance query acceleration on massive networks. In: Proceedings of the 25th ACM International Conference on Information and Knowledge Management, CIKM 2016, Indianapolis, IN, USA, 24–28 October 2016, pp. 1533–1542. ACM (2016)
Jiang, M., Fu, A.W., Wong, R.C., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. PVLDB 7(12), 1203–1214 (2014)
Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, 30 June - 5 July 2019, pp. 1060–1077 (2019)
Li, Y., U, L.H., Yiu, M.L., Kou, N.M.: An experimental study on hub labeling based shortest path algorithms. PVLDB 11(4), 445–457 (2017)
Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, 2–6 November 2009, pp. 867–876. ACM (2009)
Qi, Z., Xiao, Y., Shao, B., Wang, H.: Toward a distance oracle for billion-node graphs. PVLDB 7(1), 61–72 (2013)
Qin, Y., Sheng, Q.Z., Falkner, N.J.G., Yao, L., Parkinson, S.: Efficient computation of distance labeling for decremental updates in large dynamic graphs. World Wide Web 20(5), 915–937 (2016). https://doi.org/10.1007/s11280-016-0421-1
Ren, X., Wang, J., Han, W., Yu, J.X.: Fast and robust distributed subgraph enumeration. PVLDB 12(11), 1344–1356 (2019)
Rombach, P., Porter, A.A., Fowler, J.H., Mucha, P.J.: Core-periphery structure in networks (revisited). SIAM review 59(3), 619–646 (2014)
Sadri, A., Salim, F.D., Ren, Y., Zameni, M., Chan, J., Sellis, T.: Shrink: Distance preserving graph compression. Inf. Syst. 69, 180–193 (2017)
Sarma, A.D., Gollapudi, S., Najork, M., Panigrahy, R.: A sketch-based distance oracle for web-scale graphs. In: Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, pp. 401–410. ACM (2010)
Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. IEEE Trans. Knowl. Data Eng. 29(3), 599–612 (2017)
Wei, Fang: Efficient graph reachability query answering using tree decomposition. In: Kučera, Antonín, Potapov, Igor (eds.) RP 2010. LNCS, vol. 6227, pp. 183–197. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15349-5_13
Wei-Kleiner, F.: Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs. J. Comput. Syst. Sci. 82(1), 23–44 (2016)
Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. PVLDB 5(5), 406–417 (2012)
Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2013, New York, NY, USA, 22–27 June 2013, pp. 857–868. ACM (2013)
Acknowledgement
This work is partly supported by The Science and Technology Development Fund, Macau SAR, with the code FDCT-SKL-IOTSC-2018–2020 and FDCT/0045/2019/A1.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, J., Anirban, S., Amagasa, T., Shiokawa, H., Gong, Z., Islam, M.S. (2020). A Hybrid Index for Distance Queries. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2020. WISE 2020. Lecture Notes in Computer Science(), vol 12342. Springer, Cham. https://doi.org/10.1007/978-3-030-62005-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-030-62005-9_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62004-2
Online ISBN: 978-3-030-62005-9
eBook Packages: Computer ScienceComputer Science (R0)