Reasoning about XML update constraints, PODS'07, pp.195-204 ,
URL : https://hal.archives-ouvertes.fr/inria-00137171
Representing and querying XML with incomplete information, ACM Transactions on Database Systems, vol.31, issue.1, pp.208-254, 2006. ,
DOI : 10.1145/1132863.1132869
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.5285
XML with data values, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.688-727, 2003. ,
DOI : 10.1145/375551.375570
XML schema mappings, PODS'09, pp.33-42 ,
DOI : 10.1145/1559795.1559801
Tree pattern query minimization, The VLDB Journal The International Journal on Very Large Data Bases, vol.11, issue.4, pp.315-331, 2002. ,
DOI : 10.1007/s00778-002-0076-7
Relational and XML Data Exchange, Synthesis Lectures on Data Management, vol.2, issue.1, 2010. ,
DOI : 10.2200/S00297ED1V01Y201008DTM008
On the Complexity of Verifying Consistency of XML Specifications, SIAM Journal on Computing, vol.38, issue.3, pp.841-880, 2008. ,
DOI : 10.1137/050646895
XML data exchange: consistency and query answering, J. ACM, vol.55, issue.2, 2008. ,
XML with incomplete information, Journal of the ACM, vol.58, issue.1, p.1, 2010. ,
DOI : 10.1145/1870103.1870107
Optimizing Conjunctive Queries over Trees Using Schema Information, MFCS'08, pp.132-143 ,
DOI : 10.1007/978-3-540-85238-4_10
Conjunctive query containment over trees, JCSS, vol.77, issue.3, pp.450-472, 2011. ,
Validity of Tree Pattern Queries with Respect to Schema Information ,
DOI : 10.1007/978-3-642-40313-2_17
Two-Variable Logic on Words with Data, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.7-16 ,
DOI : 10.1109/LICS.2006.51
URL : https://hal.archives-ouvertes.fr/hal-00151749
Regular XPath: constraints, query containment and view-based answering for XML documents, LID'08 ,
Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.77-90 ,
DOI : 10.1145/800105.803397
Complexity of Data Tree Patterns over XML Documents, MFCS'08, pp.278-289 ,
DOI : 10.1007/978-3-540-85238-4_22
On XML integrity constraints in the presence of DTDs, Journal of the ACM, vol.49, issue.3, pp.368-406, 2002. ,
DOI : 10.1145/567112.567117
Satisfiability of downward XPath with data equality tests, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.197-206 ,
DOI : 10.1145/1559795.1559827
A system for the static analysis of XPath, ACM Transactions on Information Systems, vol.24, issue.4, pp.475-502, 2006. ,
DOI : 10.1145/1185877.1185882
On the complexity of query answering over incomplete XML documents, Proceedings of the 15th International Conference on Database Theory, ICDT '12, pp.169-181 ,
DOI : 10.1145/2274576.2274595
Conjunctive queries over trees, Journal of the ACM, vol.53, issue.2, pp.238-272, 2006. ,
DOI : 10.1145/1131342.1131345
URL : http://arxiv.org/abs/cs/0602004
Containment of Conjunctive Queries on Annotated Relations, Theory of Computing Systems, vol.27, issue.4, pp.429-459, 2011. ,
DOI : 10.1007/s00224-011-9327-6
Answering queries using views: A survey, The VLDB Journal, vol.10, issue.4, pp.270-294, 2001. ,
DOI : 10.1007/s007780100054
Revisiting redundancy and minimization in an XPath fragment, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.61-72 ,
DOI : 10.1145/1353343.1353355
On conjunctive queries containing inequalities, Journal of the ACM, vol.35, issue.1, pp.146-160, 1988. ,
DOI : 10.1145/42267.42273
On the complexity of the containment problem for conjunctive queries with built-in predicates, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.197-204 ,
DOI : 10.1145/275487.275510
Data integration, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.233-246 ,
DOI : 10.1145/543613.543644
Reasoning about XML with temporal logics and automata, Journal of Applied Logic, vol.8, issue.2, pp.210-232, 2010. ,
DOI : 10.1016/j.jal.2009.09.005
URL : http://doi.org/10.1016/j.jal.2009.09.005
Simple off the shelf abstractions for XML schema, ACM SIGMOD Record, vol.36, issue.3, pp.15-22, 2007. ,
DOI : 10.1145/1324185.1324188
Exact XML Type Checking in Polynomial Time, ICDT 2007, pp.254-268 ,
DOI : 10.1007/11965893_18
Containment and equivalence for a fragment of XPath, Journal of the ACM, vol.51, issue.1, pp.2-45, 2004. ,
DOI : 10.1145/962446.962448
Automata, Logic, and XML, CSL 2002, pp.2-26 ,
DOI : 10.1007/3-540-45793-3_2
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables, Logical Methods in Computer Science, vol.2, issue.3, 2006. ,
DOI : 10.2168/LMCS-2(3:1)2006
Equivalences Among Relational Expressions with the Union and Difference Operators, Journal of the ACM, vol.27, issue.4, pp.633-655, 1980. ,
DOI : 10.1145/322217.322221
XPath query containment, SIGMOD Record, vol.33, issue.1, pp.101-109, 2004. ,
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, Journal of Computer and System Sciences, vol.1, issue.4, pp.317-322, 1967. ,
DOI : 10.1016/S0022-0000(67)80022-9
The complexity of querying indefinite data about linearly ordered domains, JCSS, vol.54, issue.1, pp.113-135, 1997. ,
A web Odyssey: from Codd to XML, PODS'01, pp.1-15 ,