Reasoning about XML update constraints

  • Authors:
  • Bogdan Cautis;Serge Abiteboul;Tova Milo

  • Affiliations:
  • Telecom ParisTech, Computer Science Department, 46, rue Barrault, 75013 Paris, France;I.N.R.I.A. Futurs, 4 Rue J. Monod, Parc Club Université, 91893 Orsay Cedex, France;Tel Aviv University, School of Computer Science, Schreiber Building, Ramat Aviv, Tel Aviv 69978, Israel

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce in this paper a class of constraints for describing how an XML document can evolve, namely 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 in which we take into account data. 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.