Skip to main content
SpringerLink
Log in

Compression techniques for 2-hop labeling for shortest distance queries

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Shortest distance computation is one of the widely researched areas in theoretical computer science and graph databases. Distance labeling are well-known for improving the performance of shortest distance queries. One of the best distance labeling approaches is Pruned Landmark Labeling (PLL). PLL is a 2-hop distance labeling which prunes a lot of unnecessary labels while doing breadth-first-search. Another well-known 2-hop labeling is Pruned Highway Labeling (PHL) which is designed for undirected road networks. Both PLL and PHL suffer from the problem of large index size. In this paper, we propose two approaches to address the problem, one is to compress the PLL index as well as the graph for directed graphs; the other is to compress undirected road networks using linear sets, which are essentially maximal-length non-branching paths. Our aim is to reduce the index size and index construction time without significantly compromising query performance. Extensive experiments with real world datasets confirm the effectiveness of our approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. https://snap.stanford.edu/data/

  2. http://networkrepository.com

References

  1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7501, pp 24–35 (2012)

  2. Akiba, T., Iwata, Y., Kawarabayashi, K., Kawata, Y.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: ALENEX, pp 47–154 (2014)

  3. Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD. https://doi.org/10.1145/2463676.2465315, pp 349–360 (2013)

  4. Akiba, T., Sommer, C., Kawarabayashi, K.: Shortest-path queries for complex networks: exploiting low tree-width outside the core. In: EDBT. https://doi.org/10.1145/2247596.2247614, pp 144–155 (2012)

  5. Anirban, S., Wang, J., Islam, M.S.: Modular decomposition-based graph compression for fast reachability detection. Data Sci. Eng. 4, 193–207 (2019). https://doi.org/10.1007/s41019-019-00099-9

    Article  Google Scholar 

  6. Chang, L., Yu, J.X., Qin, L., Cheng, H., Qiao, M.: The exact distance to destination in undirected world. VLDB J. 21, 869–888 (2012). https://doi.org/10.1007/s00778-012-0274-x

    Article  Google Scholar 

  7. Chen, W., Sommer, C., Teng, S., Wang, Y.: A compact routing scheme and approximate distance oracle for power-law graphs. TALG 9, 1–26 (2012). https://doi.org/10.1145/2390176.2390180

    Article  MathSciNet  Google Scholar 

  8. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM, 937–946 (2002)

  9. Delling, D., Goldberg, A, Werneck, R: Hub label compression. In: Proceedings of the 12th International Symposium on Experimental Algorithms (SEA’13). https://www.microsoft.com/en-us/research/publication/hub-label-compression/. Springer Verlag (2013)

  10. Delling, D.: Route planning in transportation networks: from research to practice. In: SIGSPATIAL. https://doi.org/10.1145/3274895.3282802, p 2 (2018)

  11. Fan, W.: Data quality: Theory and practice. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) Web-Age Information Management - 13th International Conference, WAIM 2012, Harbin, China, August 18-20. Proceedings, Lecture Notes in Computer Science, vol. 7418, pp 1–16 (2012)

  12. Farhan, M., Wang, Q., Lin, Y., McKay, B.: A highly scalable labelling approach for exact distance queries in complex networks. In: EDBT, pp 13–24 (2019)

  13. 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, March 26-29, 2019, pp 13–24 (2019)

  14. chee Fu, A.W., Wu, H., Cheng, J., Wong, R.C.W.: Is-label: an independent-set based labeling scheme for point-to-point distance querying. In: PVLDB. https://doi.org/10.14778/2536336.2536346, vol. 6, pp 457–468 (2013)

  15. 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. In: World Wide Web. https://doi.org/10.1007/s11280-018-0643-5, vol. 22, pp 1359–1399 (2019)

  16. Hayashi, T., Akiba, T., Kawarabayashi, K.: Fully dynamic shortest-path distance query acceleration on massive networks. In: CIKM. https://doi.org/10.1145/2983323.2983731, pp 1533–1542 (2016)

  17. Jiang, M., Fu, A., Wong, R.C.W., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. In: PVLDB. https://doi.org/10.14778/2732977.2732993, vol. 7, pp 1203–1214 (2014)

  18. 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)

    Google Scholar 

  19. Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: SIGMOD. https://doi.org/10.1145/3299869.3319877, pp 060–1077 (2019)

  20. Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling up distance labeling on graphs with core-periphery properties. In: Maier, D., Pottinger, R., Doan, A., Tan, W., Alawini, A., Ngo, H.Q. (eds.) Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14-19, 2020, pp 1367–1381. ACM (2020)

  21. Li, Y., U, L.H., Yiu, M., Kou, N.: An experimental study on hub labeling based shortest path algorithms. In: PVLDB. https://doi.org/10.1145/3186728.3164141, vol. 11, pp 445–457 (2017)

  22. Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: CIKM. https://doi.org/10.1145/1645953.1646063, pp 867–876 (2009)

  23. Qiao, M., Cheng, H., Chang, L., Yu, J.X.: Approximate shortest distance computing: A query-dependent local landmark scheme. TKDE 26, 55–68 (2012). https://doi.org/10.1109/TKDE.2012.253

    Google Scholar 

  24. Ren, X., Sengupta, N., Ren, X., Wang, J., Curé, O.: Finding minimum connected subgraphs with ontology exploration on large RDF data. arXiv:2010.06336 (2020)

  25. Ren, X., Wang, J.: Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proc. VLDB Endow. 8(5), 617–628 (2015)

    Article  Google Scholar 

  26. Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI. https://networkrepository.com (2015)

  27. Shi, Y., Cheng, G., Kharlamov, E.: Keyword search over knowledge graphs via static and dynamic hub labelings. In: WWW, pp 235–245 (2020)

  28. Wang, J., Anirban, S., Amagasa, T., Shiokawa, H., Gong, Z., Islam, M.S.: A hybrid index for distance queries. In: WISE, pp 227–241 (2020)

  29. Wang, X., Zhang, Y., Zhang, W., Lin, X.: Efficient distance-aware influence maximization in geo-social networks. TKDE 29, 599–612 (2017). https://doi.org/10.1109/TKDE.2016.2633472

    Google Scholar 

  30. Yahia, S.A., Benedikt, M., Lakshmanan, L.V., Stoyanovich, J.: Efficient network aware search in collaborative tagging sites. In: PVLDB. https://doi.org/10.14778/1453856.1453934, vol. 1, pp 710–721 (2008)

Download references

Author information

Authors and Affiliations

  1. Griffith University, Gold Coast, QLD, Australia

    Shikha Anirban, Junhu Wang, Md. Saiful Islam & Humayun Kayesh

  2. Deakin University, Melbourne, Victoria, Australia

    Jianxin Li

  3. University of Technology Sydney, Sydney, NSW, Australia

    Mao Lin Huang

Authors
  1. Shikha Anirban
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junhu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Md. Saiful Islam
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Humayun Kayesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jianxin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Mao Lin Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shikha Anirban.

Ethics declarations

Conflict of Interests

The authors declare that they have no financial or non-financial interests to disclose that are relevant to the content of this article.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Anirban, S., Wang, J., Islam, M.S. et al. Compression techniques for 2-hop labeling for shortest distance queries. World Wide Web 25, 151–174 (2022). https://doi.org/10.1007/s11280-021-00977-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11280-021-00977-1

Keywords

Search

Navigation