Skip to main content
SpringerLink
Log in

Answering Graph Pattern Matching Using Views: A Revisit

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2017)

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

Included in the following conference series:

Abstract

This paper studies how to answer graph pattern matching defined in terms of subgraph isomorphism by using a set of materialized views. We first propose a notion of pattern containment to characterize graph pattern matching using graph pattern views, and show that graph pattern matching can be answered using a set of views if and only if the pattern query is contained by the views, and develop efficient algorithm to determine pattern containment. Based on this characterization, an efficient algorithm is developed to evaluate graph pattern matching using views. In addition, when a pattern query is not contained in a set of views, we study the problem of approximately answering graph pattern matching using views. We first study maximally contained (resp. containing) rewriting problems, develop algorithms to find such rewritings. We then propose techniques to find approximate answers using maximally contained (resp. containing) rewriting. Using real-life and synthetic data, we experimentally verify that these methods are able to efficiently conduct graph pattern matching on large social graphs.

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. Citation. http://www.arnetminer.org/citation/

  2. Full version. http://emlc.swjtu.edu.cn/download/WangXin/paper.pdf

  3. Stanford large network dataset collection. http://snap.stanford.edu/data/index.html

  4. Webgraph data. http://law.dsi.unimi.it/datasets.php

  5. Youtube dataset. http://netsg.cs.sfu.ca/youtubedata/

  6. Afrati, F., Chandrachud, M., Chirkova, R., Mitra, P.: Approximate rewriting of queries using views. In: Grundspenkis, J., Morzy, T., Vossen, G. (eds.) ADBIS 2009. LNCS, vol. 5739, pp. 164–178. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03973-7_13

    Chapter  Google Scholar 

  7. Conte, D., Foggia, P., Vento, M.: Challenging complexity of maximum common subgraph detection algorithms: a performance analysis of three algorithms on a wide database of graphs. J. Graph Algorithms Appl. 11(1), 99–143 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. TPAMI 26, 1367–1372 (2004)

    Article  Google Scholar 

  9. Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractability to polynomial time. PVLDB 3, 264–275 (2010)

    Google Scholar 

  10. Fan, W., Wang, X., Wu, Y.: Answering graph pattern queries using views. In: ICDE, pp. 184–195 (2014)

    Google Scholar 

  11. Fan, W., Wang, X., Wu, Y.: Answering pattern queries using views. IEEE Trans. Knowl. Data Eng. 28(2), 326–341 (2016)

    Article  Google Scholar 

  12. Fan, W., Wang, X., Wu, Y., Xu, J.: Association rules with graph patterns. PVLDB 8(12), 1502–1513 (2015)

    Google Scholar 

  13. Faris, R., Ennett, S.: Adolescent aggression: the role of peer group status motives, peer aggression, and group characteristics. Soc. Netw. 34(4), 371–378 (2012)

    Article  Google Scholar 

  14. Halevy, A.: Answering queries using views: a survey. VLDB J. 10(4), 270–294 (2001)

    Article  MATH  Google Scholar 

  15. Halevy, A.: Theory of answering queries using views. SIGMOD Rec. 29, 40–47 (2001)

    Article  MATH  Google Scholar 

  16. Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)

    Google Scholar 

  17. Lappas, T., Liu, K., Terzi, E.: A survey of algorithms and systems for expert location in social networks. Soc. Netw. Data Anal. 215–241 (2011)

    Google Scholar 

  18. Lenzerini, M.: Data integration: a theoretical perspective. In: PODS (2002)

    Google Scholar 

  19. Leskovec, J., Singh, A., Kleinberg, J.: Patterns of influence in a recommendation network. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS, vol. 3918, pp. 380–389. Springer, Heidelberg (2006). doi:10.1007/11731139_44

    Chapter  Google Scholar 

  20. Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: PODS (1995)

    Google Scholar 

  21. Li, J., Cao, Y., Liu, X.: Approximating graph pattern queries using views. CIKM 2016, 449–458 (2016)

    Google Scholar 

  22. Lu, L., Zhou, T.: Link prediction in complex networks: A survey. CoRR, abs/1010.0725 (2010)

    Google Scholar 

  23. Miklau, G., Suciu, D.: Containment and equivalence for an xpath fragment. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS) (2002)

    Google Scholar 

  24. Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 315–329. Springer, Heidelberg (2003). doi:10.1007/3-540-36285-1_21

    Chapter  Google Scholar 

  25. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)

    Google Scholar 

  26. Terveen, L.G., McDonald, D.W.: Social matching: a framework and research agenda. ACM Trans. Comput.-Hum. Interact. 12, 401–434 (2005)

    Article  Google Scholar 

  27. Wikipedia. F-measure. http://en.wikipedia.org/wiki/F-measure

Download references

Acknowledgments

This work is supported by NSFC 61402383 and 71490722, Sichuan Provincial Science and Technology Project 2014JY0207, and Fundamental Research Funds for the Central Universities, China.

Author information

Authors and Affiliations

  1. Southwest Jiaotong University, Chengdu, China

    Xin Wang

Authors
  1. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xin Wang .

Editor information

Editors and Affiliations

  1. University of Lyon, Villeurbanne, France

    Djamal Benslimane

  2. University of Milan, Milan, Italy

    Ernesto Damiani

  3. University of Michigan, Dearborn, Michigan, USA

    William I. Grosky

  4. Paul Sabatier University, Toulouse, France

    Abdelkader Hameurlain

  5. Wright State University, Dayton, Ohio, USA

    Amit Sheth

  6. Johannes Kepler University, Linz, Austria

    Roland R. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wang, X. (2017). Answering Graph Pattern Matching Using Views: A Revisit. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10438. Springer, Cham. https://doi.org/10.1007/978-3-319-64468-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64468-4_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64467-7

  • Online ISBN: 978-3-319-64468-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation