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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Citation. http://www.arnetminer.org/citation/
Full version. http://emlc.swjtu.edu.cn/download/WangXin/paper.pdf
Stanford large network dataset collection. http://snap.stanford.edu/data/index.html
Webgraph data. http://law.dsi.unimi.it/datasets.php
Youtube dataset. http://netsg.cs.sfu.ca/youtubedata/
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
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)
Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. TPAMI 26, 1367–1372 (2004)
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)
Fan, W., Wang, X., Wu, Y.: Answering graph pattern queries using views. In: ICDE, pp. 184–195 (2014)
Fan, W., Wang, X., Wu, Y.: Answering pattern queries using views. IEEE Trans. Knowl. Data Eng. 28(2), 326–341 (2016)
Fan, W., Wang, X., Wu, Y., Xu, J.: Association rules with graph patterns. PVLDB 8(12), 1502–1513 (2015)
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)
Halevy, A.: Answering queries using views: a survey. VLDB J. 10(4), 270–294 (2001)
Halevy, A.: Theory of answering queries using views. SIGMOD Rec. 29, 40–47 (2001)
Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)
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)
Lenzerini, M.: Data integration: a theoretical perspective. In: PODS (2002)
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
Levy, A.Y., Mendelzon, A.O., Sagiv, Y., Srivastava, D.: Answering queries using views. In: PODS (1995)
Li, J., Cao, Y., Liu, X.: Approximating graph pattern queries using views. CIKM 2016, 449–458 (2016)
Lu, L., Zhou, T.: Link prediction in complex networks: A survey. CoRR, abs/1010.0725 (2010)
Miklau, G., Suciu, D.: Containment and equivalence for an xpath fragment. In: Proceedings of ACM Symposium on Principles of Database Systems (PODS) (2002)
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
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Boston (1994)
Terveen, L.G., McDonald, D.W.: Social matching: a framework and research agenda. ACM Trans. Comput.-Hum. Interact. 12, 401–434 (2005)
Wikipedia. F-measure. http://en.wikipedia.org/wiki/F-measure
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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)