Querying XML data sources that export very large sets of views

We study the problem of querying XML data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially infinite) families of XPath queries. To compactly specify such families of queries we adopt the Query Set Specifications, a formalism close to context-free grammars. We say that query Q is expressible by the specification P if it is equivalent to some expansion of P. Q is supported by P if it has an equivalent rewriting using some finite set of P's expansions. We study the complexity of expressibility and support and identify large classes of XPath queries for which there are efficient (PTIME) algorithms. Our study considers both the case in which the XML nodes in the results of the queries lose their original identity and the one in which the source exposes persistent node ids.

[1]  Alin Deutsch,et al.  Efficient Rewriting of XPath Queries Using Query Set Specifications , 2009, Proc. VLDB Endow..

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

[3]  Laks V. S. Lakshmanan,et al.  Tree pattern query minimization , 2002, The VLDB Journal.

[4]  Alin Deutsch,et al.  The Query Set Specification Language (QSSL) , 2003, WebDB.

[5]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[6]  Yannis Papakonstantinou,et al.  Expressive Capabilities Description Languages and Query Rewriting Algorithms , 2000, J. Log. Program..

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

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

[11]  Alin Deutsch,et al.  Querying Data Sources that Export Infinite Sets of Views , 2011, ICDT '09.

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

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Alin Deutsch,et al.  Querying data sources that export infinite sets of views , 2009, ICDT.

[15]  Serge Abiteboul,et al.  Reasoning about XML update constraints , 2007, J. Comput. Syst. Sci..

[16]  Z. Meral Özsoyoglu,et al.  A tree-structured query interface for querying semi-structured data , 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

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

[18]  Jeffrey D. Ullman,et al.  Answering Queries Using Limited External Query Processors , 1999, J. Comput. Syst. Sci..

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[20]  Wenfei Fan,et al.  Rewriting Regular XPath Queries on XML Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[21]  Gerhard Weikum,et al.  ACM Transactions on Database Systems , 2005 .

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

[23]  Jeffrey D. Ullman,et al.  A Query Translation Scheme for Rapid Implementation of Wrappers , 1995, DOOD.

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

[25]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[26]  Alin Deutsch,et al.  XPath Rewriting Using Multiple Views: Achieving Completeness and Efficiency , 2008, WebDB.

[27]  Kam-Fai Wong,et al.  Multiple Materialized View Selection for XPath Query Rewriting , 2008, 2008 IEEE 24th International Conference on Data Engineering.

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