View-based rewriting of XML queries

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

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

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

[4]  Laks V. S. Lakshmanan,et al.  On Testing Satisfiability of Tree Pattern Queries , 2004, VLDB.

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

[6]  Vasilis Vassalos,et al.  On Equivalence and Rewriting of XPath Queries Using Views under DTD Constraints , 2011, DEXA.

[7]  Jeffrey Xu Yu,et al.  On Tree Pattern Query Rewriting Using Views , 2007, WISE.

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

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

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

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

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

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

[14]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

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

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

[17]  Wanhong Xu,et al.  The Framework of an XML Semantic Caching System , 2005, WebDB.

[18]  Thomas Schwentick,et al.  On the complexity of XPath containment in the presence of disjunction, DTDs, and variables , 2006, Log. Methods Comput. Sci..

[19]  Carsten Lutz,et al.  The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.

[20]  A. Karimi,et al.  Master‟s thesis , 2011 .

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

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

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

[24]  Tim Furche,et al.  XPath: Looking Forward , 2002, EDBT Workshops.

[25]  Yehoshua Sagiv,et al.  Revisiting redundancy and minimization in an XPath fragment , 2008, EDBT '08.

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

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

[28]  Maarten Marx,et al.  XPath with Conditional Axis Relations , 2004, EDBT.

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

[30]  Peter T. Wood,et al.  XPath Query Satisfiability is in PTIME for Real-World DTDs , 2007, XSym.

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

[32]  Thomas Schwentick,et al.  XPath query containment , 2004, SGMD.

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

[34]  Dan Suciu,et al.  Index Structures for Path Expressions , 1999, ICDT.

[35]  Yannis Papakonstantinou,et al.  The Enosys Markets data integration platform: lessons from the trenches , 2001, CIKM '01.