Reasoning about XML Update Constraints

Bogdan Cautis 1 Serge Abiteboul 1 Tova Milo 1
1 GEMO - Integration of data and knowledge distributed over the web
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : We introduce in this paper a class of constraints for describing how an XML document can evolve, namely \emph{XML update constraints}. For these constraints, we study the implication problem, giving algorithms and complexity results for constraints of varying expressive power. Besides classical constraint implication, we also consider an instance-based approach. More precisely, we study implication with respect to a current tree instance, resulting from a series of unknown updates. The main motivation of our work is reasoning about data integrity under update restrictions in contexts where owners may lose control over their data, such as in publishing or exchange.
Document type :
Conference papers
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download
Contributor : Bogdan Cautis <>
Submitted on : Friday, March 16, 2007 - 11:23:45 PM
Last modification on : Monday, December 9, 2019 - 5:24:06 PM
Long-term archiving on: Tuesday, April 6, 2010 - 10:28:59 PM


Files produced by the author(s)


  • HAL Id : inria-00137171, version 1



Bogdan Cautis, Serge Abiteboul, Tova Milo. Reasoning about XML Update Constraints. 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2007, Pekin, China. ⟨inria-00137171⟩



Record views


Files downloads