Answering graph pattern queries using views

Answering queries using views has proven an effective technique for querying relational and semistructured data. This paper investigates this issue for graph pattern queries based on (bounded) simulation, which have been increasingly used in, e.g., social network analysis. We propose a notion of pattern containment to characterize graph pattern matching using graph pattern views. We show that a graph pattern query can be answered using a set of views if and only if the query is contained in the views. Based on this characterization we develop efficient algorithms to answer graph pattern queries. In addition, we identify three problems associated with graph pattern containment. We show that these problems range from quadratic-time to NP-complete, and provide efficient algorithms for containment checking (approximation when the problem is intractable). Using real-life data and synthetic data, we experimentally verify that these methods are able to efficiently answer graph pattern queries on large social graphs, by using views.

[1]  Wenfei Fan,et al.  Secure XML querying with security views , 2004, SIGMOD '04.

[2]  Shankar Pal,et al.  Managing Collections of XML Schemas in Microsoft SQL Server 2005 , 2006, EDBT.

[3]  Shuigeng Zhou,et al.  A Theoretic Framework for Answering XPath Queries Using Views , 2005, XSym.

[4]  Diego Calvanese,et al.  View-based query processing and constraint satisfaction , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[5]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[6]  Georg Gottlob,et al.  XPath query evaluation: improving time and space efficiency , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

[7]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

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

[9]  Scott Boag,et al.  XQuery 1.0 : An XML Query Language , 2007 .

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

[11]  Cong Yu,et al.  TIMBER: A native XML database , 2002, The VLDB Journal.

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

[13]  Jignesh M. Patel,et al.  Structural joins: a primitive for efficient XML query pattern matching , 2002, Proceedings 18th International Conference on Data Engineering.

[14]  Tim Kraska,et al.  Generalized scale independence through incremental precomputation , 2013, SIGMOD '13.

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

[16]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[17]  Nick Roussopoulos,et al.  The Implementation and Performance Evaluation of the ADMS Query Optimizer: Integrating Query Result Caching and Matching , 1994, EDBT.

[18]  Laks V. S. Lakshmanan,et al.  Answering tree pattern queries using views , 2006, VLDB.

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

[20]  Laks V. S. Lakshmanan,et al.  Minimization of tree pattern queries , 2001, SIGMOD '01.

[21]  Diego Calvanese,et al.  Answering regular path queries using views , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

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

[23]  Motomichi Toyama,et al.  XML Cache Management Based On XPath Containment Relationship , 2005, 21st International Conference on Data Engineering Workshops (ICDEW'05).

[24]  Andy Schürr,et al.  Incremental Graph Pattern Matching , 2006 .

[25]  Mong-Li Lee,et al.  Efficient Mining of XML Query Patterns for Caching , 2003, VLDB.

[26]  Ioana Manolescu,et al.  Structured Materialized Views for XML Queries , 2007, VLDB.

[27]  Carlos A. Hurtado,et al.  Edinburgh Research Explorer Expressive Languages for Path Queries over Graph-Structured Data , 2012 .

[28]  Lisa Kaati,et al.  Detecting Social Positions Using Simulation , 2010, 2010 International Conference on Advances in Social Networks Analysis and Mining.

[29]  Yannis Papakonstantinou,et al.  Query Rewriting using Semistructured Views , 1999 .

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

[31]  Jérôme Euzenat,et al.  PSPARQL Query Containment , 2011, DBPL.

[32]  CaoYang,et al.  Capturing topology in graph pattern matching , 2011, VLDB 2011.

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

[34]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

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

[36]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[37]  Elio Masciari,et al.  On the minimization of XPath queries , 2003, JACM.

[38]  Dan Suciu,et al.  Query Caching and View Selection for XML Databases , 2005, VLDB.

[39]  Tianyu Wo,et al.  Capturing Topology in Graph Pattern Matching , 2011, Proc. VLDB Endow..

[40]  Yannis Papakonstantinou,et al.  Query rewriting for semistructured data , 1999, SIGMOD '99.

[41]  Peter T. Wood,et al.  Containment for XPath Fragments under DTD Constraints , 2003, ICDT.

[42]  Alin Deutsch,et al.  Reformulation of XML Queries and Constraints , 2003, ICDT.

[43]  Dan Suciu,et al.  Containment and equivalence for a fragment of XPath , 2004, JACM.

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

[45]  Gabriel M. Kuper,et al.  Structural properties of XPath fragments , 2003, Theor. Comput. Sci..

[46]  Albert G. Greenberg,et al.  The cost of a cloud: research problems in data center networks , 2008, CCRV.

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

[48]  Alon Y. Halevy,et al.  MiniCon: A scalable algorithm for answering queries using views , 2000, The VLDB Journal.

[49]  Feifei Li,et al.  Rewriting queries on SPARQL views , 2011, WWW.

[50]  Z. Meral Özsoyoglu,et al.  Rewriting XPath Queries Using Materialized Views , 2005, VLDB.

[51]  Alin Deutsch,et al.  Containment and Integrity Constraints for XPath , 2001, KRDB.

[52]  Yue Zhuge,et al.  Graph structured views and their incremental maintenance , 1998, Proceedings 14th International Conference on Data Engineering.

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

[54]  Hamid Pirahesh,et al.  A Framework for Using Materialized XPath Views in XML Query Processing , 2004, VLDB.

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

[56]  Xiaoying Wu,et al.  Answering XML queries using materialized views revisited , 2009, CIKM.

[57]  Alex Thomo,et al.  Query containment and rewriting using views for regular path queries under constraints , 2003, PODS.

[58]  Philip S. Yu,et al.  ViST: a dynamic index method for querying XML data by tree structures , 2003, SIGMOD '03.