Answering Graph Pattern Matching Using Views: A Revisit

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.

[1]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[2]  Dan Suciu,et al.  Containment and equivalence for an XPath fragment , 2002, PODS.

[3]  Jianzhong Li,et al.  Graph pattern matching , 2010, Proc. VLDB Endow..

[4]  Mario Vento,et al.  A (sub)graph isomorphism algorithm for matching large graphs , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Robert W. Faris,et al.  Adolescent aggression: The role of peer group status motives, peer aggression, and group characteristics , 2012, Soc. Networks.

[6]  Jiang Li,et al.  Answering tree pattern queries using views: a revisit , 2011, EDBT/ICDT '11.

[7]  David W. McDonald,et al.  Social matching: A framework and research agenda , 2005, TCHI.

[8]  Mario Vento,et al.  Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs , 2007, J. Graph Algorithms Appl..

[9]  Theodoros Lappas,et al.  A Survey of Algorithms and Systems for Expert Location in Social Networks , 2011, Social Network Data Analytics.

[10]  Xin Wang,et al.  Association Rules with Graph Patterns , 2015, Proc. VLDB Endow..

[11]  Thomas Schwentick,et al.  XPath Containment in the Presence of Disjunction, DTDs, and Variables , 2003, ICDT.

[12]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Xin Wang,et al.  Answering graph pattern queries using views , 2006, 2014 IEEE 30th International Conference on Data Engineering.

[14]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[15]  Jure Leskovec,et al.  Patterns of Influence in a Recommendation Network , 2006, PAKDD.

[16]  Rada Chirkova,et al.  Approximate Rewriting of Queries Using Views , 2009, ADBIS.

[17]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[18]  Jia Li,et al.  Approximating Graph Pattern Queries Using Views , 2016, CIKM.

[19]  Ravi Kumar,et al.  Structure and evolution of online social networks , 2006, KDD '06.

[20]  Xin Wang,et al.  Answering Pattern Queries Using Views , 2016, IEEE Transactions on Knowledge and Data Engineering.

[21]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[22]  Alon Y. Halevy,et al.  Theory of answering queries using views , 2000, SGMD.

[23]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.