Reasoning about XML Update Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Reasoning about XML Update Constraints


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.
Fichier principal
Vignette du fichier
pods071-cautis.pdf (194.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00137171 , version 1 (16-03-2007)


  • 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⟩
109 View
114 Download


Gmail Facebook Twitter LinkedIn More