Incremental Maintenance for Materialized Views over Semistructured Data, International Conference on Very Large Data Bases (VLDB), pp.38-49, 1998. ,
Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004. ,
DOI : 10.1145/1007352.1007390
Consistent query answers in inconsistent databases, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '99, pp.68-79, 1999. ,
DOI : 10.1145/303976.303983
XML Data Exchange: Consistency and Query Answering, ACM Symposium on Principles of Database Systems (PODS), pp.13-24, 2005. ,
Incremental validation of XML documents, ACM Transactions on Database Systems, vol.29, issue.4, pp.710-751, 2004. ,
DOI : 10.1145/1042046.1042050
Tree Edit Distance, Aligment and Inclusion, 2003. ,
Twovariable logic on data trees and xml reasoning, PODS, pp.10-19, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00151833
Parameterized Complexity: The Main Ideas and Connections to Practical Computing, Electronic Notes in Theoretical Computer Science (ENTCS), p.61, 2002. ,
DOI : 10.1007/3-540-36383-1_3
Repairs and Consistent Answers for XML Data with Functional Dependencies, International XML Database Symposium (Xsym), pp.238-253, 2003. ,
DOI : 10.1007/978-3-540-39429-7_16
Querying and Repairing Inconsistent XML Data, Web Information Systems Engineering (WISE), pp.175-188, 2005. ,
DOI : 10.1007/11581062_14
Query evaluation on compressed trees, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.188-200, 2003. ,
DOI : 10.1109/LICS.2003.1210058
Complexity of Earliest Query Answering with Streaming Tree Automata, Programming Language Technologies for XML (PLAN-X), 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00336169
Visibly pushdown automata for streaming XML, Proceedings of the 16th international conference on World Wide Web , WWW '07, pp.1053-1062, 2007. ,
DOI : 10.1145/1242572.1242714
Data exchange and incomplete information, Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '06, pp.60-69, 2006. ,
DOI : 10.1145/1142351.1142360
The complexity of tree automata and XPath on grammar-compressed trees, Theoretical Computer Science, vol.363, issue.2, pp.196-210, 2006. ,
DOI : 10.1016/j.tcs.2006.07.024
Declarative Inconsistencies Handling in Relational and Semistructured Databases, 2007. ,
Validity-Sensitive Querying of XML Databases, EDBT Workshops (dataX), pp.164-177, 2006. ,
DOI : 10.1007/11896548_16
Querying Regular Sets of XML Documents, International Workshop on Logic in Databases (LiD), 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00275491
Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical System Theory, pp.57-82, 1968. ,
DOI : 10.1007/BF01691346
Visibly Pushdown Transducers for Approximate Validation of Streaming XML, Foundations of Information and Knowledge Systems (FOIKS), pp.219-238, 2008. ,
DOI : 10.1007/978-3-540-77684-0_16
The Complexity of Relational Query Languages, ACM Symposium on Theory of Computing (STOC), pp.137-146, 1982. ,