Efficient XQuery rewriting using multiple views

We consider the problem of rewriting XQuery queries using multiple materialized XQuery views. The XQuery dialect we use to express views and queries corresponds to tree patterns (returning data from several nodes, at different granularities, ranging from node identifiers to full XML subtrees) with value joins. We provide correct and complete algorithms for finding minimal rewritings, in which no view is redundant. Our work extends the state of the art by considering more flexible views than the mostly XPath 1.0 dialects previously considered, and more powerful rewritings. We implemented our algorithms and assess their performance through a set of experiments.

[1]  Alin Deutsch,et al.  Rewriting nested XML queries using nested views , 2006, SIGMOD Conference.

[2]  Mong-Li Lee,et al.  Mining frequent query patterns from XML queries , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

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

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

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

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

[7]  Ioana Manolescu,et al.  XMark: A Benchmark for XML Data Management , 2002, VLDB.

[8]  Torsten Grust,et al.  XQuery Processors , 2009, Encyclopedia of Database Systems.

[9]  HalevyAlon,et al.  MiniCon: A scalable algorithm for answering queries using views , 2001, VLDB 2001.

[10]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[11]  Tok Wang Ling,et al.  From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching , 2005, VLDB.

[12]  Alon Y. Halevy,et al.  Efficient query reformulation in peer data management systems , 2004, SIGMOD '04.

[13]  Hao Tang,et al.  Materialized View Selection in XML Databases , 2009, DASFAA.

[14]  Konstantinos Karanasos,et al.  Viewing a world of annotations through AnnoVIP , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

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

[16]  Chee Yong Chan,et al.  ViewJoin: Efficient view-based evaluation of tree pattern queries , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

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

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

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

[20]  M. Tamer Özsu,et al.  InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation , 2006, 18th International Conference on Scientific and Statistical Database Management (SSDBM'06).

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