Skip to main content
SpringerLink
Log in

Hop-Constrained Subgraph Query and Summarization on Large Graphs

  • Conference paper
  • First Online:
Database Systems for Advanced Applications. DASFAA 2021 International Workshops (DASFAA 2021)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12680))

Included in the following conference series:

Abstract

We study the problem of hop-constrained relation discovery in a graph, i.e., finding the structural relation between a source node s and a target node t within k hops. Previously studied \(s-t\) graph problems, such as distance query and path enumeration, fail to reveal the \(s-t\) relation as a big picture. In this paper, we propose the k-hop \(s-t\) subgraph query, which returns the subgraph containing all paths from s to t within k hops. Since the subgraph may be too large to be well understood by the users, we further present a graph summarization method to uncover the key structure of the subgraph. Experiments show the efficiency of our algorithms against the existing path enumeration based method, and the effectiveness of the summarization.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. http://konect.uni-koblenz.de/

  2. http://law.di.unimi.it/webdata/

  3. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths, pp. 24–35 (2012)

    Google Scholar 

  4. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566 (2007)

    Article  MathSciNet  Google Scholar 

  5. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra’s algorithm. ACM J. Exp. Algorithmics 15(2.3) (2010)

    Google Scholar 

  6. Chang, L., Lin, X., Qin, L., Yu, J.X., Pei, J.: Efficiently computing top-k shortest path join. In: EDBT 2015–18th International Conference on Extending Database Technology, Proceedings (2015)

    Google Scholar 

  7. Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: K-reach: who is in your small world. Proc. VLDB Endow. 5(11), 1292–1303 (2012)

    Article  Google Scholar 

  8. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust exact distance queries on massive networks. Microsoft Research, USA, Technical report 2 (2014)

    Google Scholar 

  9. Dunne, C., Shneiderman, B.: Motif simplification: improving network visualization readability with fan, connector, and clique glyphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 3247–3256. ACM (2013)

    Google Scholar 

  10. Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)

    Article  MathSciNet  Google Scholar 

  11. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68552-4_24

    Chapter  Google Scholar 

  12. Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165. Society for Industrial and Applied Mathematics (2005)

    Google Scholar 

  13. Grossi, R., Marino, A., Versari, L.: Efficient algorithms for listing k disjoint st-paths in graphs, pp. 544–557 (2018)

    Google Scholar 

  14. Jiang, M., Fu, A.W., Wong, R.C., Xu, Y.: Hop doubling label indexing for point-to-point distance querying on scale-free networks. Very Large Data Bases 7(12), 1203–1214 (2014)

    Google Scholar 

  15. Jiménez, V.M., Marzal, A.: Computing the K shortest paths: a new algorithm and an experimental comparison. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 15–29. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48318-7_4

    Chapter  Google Scholar 

  16. Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 123–134. ACM (2010)

    Google Scholar 

  17. LeFevre, K., Terzi, E.: Grass: graph structure summarization. In: Proceedings of the 2010 SIAM International Conference on Data Mining, pp. 454–465. SIAM (2010)

    Google Scholar 

  18. Martins, E.Q., Pascoal, M.M.: A new implementation of yens ranking loopless paths algorithm. Q. J. Belgian French Italian Oper. Res. Soc. 1(2), 121–133 (2003)

    MathSciNet  MATH  Google Scholar 

  19. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)

    Google Scholar 

  20. Pan, J.Y., Yang, H.J., Faloutsos, C., Duygulu, P.: Automatic multimedia cross-modal correlation discovery. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 653–658. ACM (2004)

    Google Scholar 

  21. Peng, Y., Zhang, Y., Lin, X., Zhang, W., Qin, L., Zhou, J.: Hop-constrained ST simple path enumeration: Towards bridging theory and practice. Proc. VLDB Endow. 13(4), 463–476 (2019)

    Article  Google Scholar 

  22. Purohit, M., Prakash, B.A., Kang, C., Zhang, Y., Subrahmanian, V.: Fast influence-based coarsening for large networks. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1296–1305. ACM (2014)

    Google Scholar 

  23. Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endow. 11(12), 1876–1888 (2018)

    Article  Google Scholar 

  24. Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683–697 (2016)

    Article  Google Scholar 

  25. Tang, X., Chen, Z., Zhang, H., Liu, X., Shi, Y., Shahzadi, A.: An optimized labeling scheme for reachability queries. Comput Mater. Continua 55(2), 267–283 (2018)

    Google Scholar 

  26. Tian, Y., Hankins, R.A., Patel, J.M.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 567–580. ACM (2008)

    Google Scholar 

  27. Toivonen, H., Zhou, F., Hartikainen, A., Hinkka, A.: Compression of weighted graphs. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 965–973. ACM (2011)

    Google Scholar 

  28. Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. Int. J. Very Large Data Bases 27(1), 1–26 (2018)

    Google Scholar 

  29. Yen, J.Y.: Finding the k shortest loopless paths in a network. Manag. Sci. 17(11), 712–716 (1971)

    Google Scholar 

  30. Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: a total order approach. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1323–1334. ACM (2014)

    Google Scholar 

Download references

Acknowledgements

This work was supported by The National Key Research and Development Program of China under grant 2018YFB1003504, NSFC (No. 61932001), and Peking University Medicine Seed Fund for Interdisciplinary Research supported by the Fundamental Research Funds for the Central Universities (No. BMU2018MI015). This work was also supported by Beijing Academy of Artificial Intelligence (BAAI).

Author information

Authors and Affiliations

  1. Peking University, Beijing, China

    Yu Liu, Qian Ge, Yue Pang & Lei Zou

Authors
  1. Yu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qian Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yue Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lei Zou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lei Zou .

Editor information

Editors and Affiliations

  1. Aalborg University, Aalborg, Denmark

    Christian S. Jensen

  2. Singapore Management University, Singapore, Singapore

    Ee-Peng Lim

  3. Academia Sinica, Taipei, Taiwan

    De-Nian Yang

  4. National Central University, Taoyuan City, Taiwan

    Chia-Hui Chang

  5. Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jianliang Xu

  6. National Chiao Tung University, Hsinchu, Taiwan

    Wen-Chih Peng

  7. National Cheng Kung University, Tainan City, Taiwan

    Jen-Wei Huang

  8. National Tsing Hua University, Hsinchu, Taiwan

    Chih-Ya Shen

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, Y., Ge, Q., Pang, Y., Zou, L. (2021). Hop-Constrained Subgraph Query and Summarization on Large Graphs. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021 International Workshops. DASFAA 2021. Lecture Notes in Computer Science(), vol 12680. Springer, Cham. https://doi.org/10.1007/978-3-030-73216-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-73216-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-73215-8

  • Online ISBN: 978-3-030-73216-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation