Union rewritings for XPath fragments

In this paper, we study the problem of finding an equivalent rewriting of an XPath query using multiple views, and we show that the union operator may be required in order to find such a rewriting. In particular, focusing on the fragment of XPath containing both descendant edges and wildcard labels, we propose an algorithm that outputs a union of single-view rewritings (if there exists any) which equivalently rewrites a given query. For the same fragment of XPath, we give necessary and sufficient conditions for query containment and equivalence of unions of queries.

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

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

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

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

[5]  Filippo Furfaro,et al.  XPath Query Relaxation through Rewriting Rules , 2011, IEEE Transactions on Knowledge and Data Engineering.

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

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

[8]  Jeffrey Xu Yu,et al.  Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views , 2008, World Wide Web.

[9]  Dan Suciu,et al.  Type inference for queries on semistructured data , 1999, PODS '99.

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

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

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

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

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

[15]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

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

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

[18]  Jennifer Widom,et al.  Database Systems: The Complete Book , 2001 .

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

[20]  Elke A. Rundensteiner,et al.  XCache: XQuery-based Caching System , 2002, WebDB.

[21]  Sara Cohen,et al.  Bag equivalence of XPath queries , 2010, ICDT '10.

[22]  Rada Chirkova,et al.  On rewriting XPath queries using views , 2009, EDBT '09.

[23]  Peter T. Wood.  Minimising Simple XPath Expressions , 2001, WebDB.

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

[25]  Jianxin Li,et al.  Containment between Unions of XPath Queries , 2009, DASFAA.

[26]  Jeffrey Xu Yu,et al.  XPath Rewriting Using Multiple Views , 2008, DEXA.