Single-view determinacy and rewriting completeness for a fragment of XPath queries
暂无分享,去创建一个
[1] Gabriel M. Kuper,et al. Structural properties of XPath fragments , 2003, Theor. Comput. Sci..
[2] Alan Nash,et al. Views and queries: Determinacy and rewriting , 2010, ACM Trans. Database Syst..
[3] Peter T. Wood. Minimising Simple XPath Expressions , 2001, WebDB.
[4] Rada Chirkova,et al. On rewriting XPath queries using views , 2009, EDBT '09.
[5] Laks V. S. Lakshmanan,et al. Minimization of tree pattern queries , 2001, SIGMOD '01.
[6] Jerzy Marcinkowski,et al. The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.
[7] Wenfei Fan,et al. View determinacy for preserving selected information in data transformations , 2012, Inf. Syst..
[8] Z. Meral Özsoyoglu,et al. Rewriting XPath Queries Using Materialized Views , 2005, VLDB.
[9] Nadime Francis. Asymptotic Determinacy of Path Queries using Union-of-Paths Views , 2015, ICDT.
[10] Dan Suciu,et al. Containment and equivalence for a fragment of XPath , 2004, JACM.
[11] Jeffrey Xu Yu,et al. Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views , 2008, World Wide Web.