Updates and Incremental Validation of XML Documents

  • Béatrice Bouchou
  • Mírian Halfeld Ferrari Alves
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2921)


We consider the incremental validation of updates on XML documents. When a valid XML document (i.e., one satisfying some constraints) is updated, it has to be verified that the new document still conforms to the imposed constraints. Incremental validation of updates leads to significant savings on computing time when compared to brute-force validation of an updated document from scratch.

This paper introduces a correct and complete set of update operations that can be integrated in an XML manipulation language. Indeed, any document generated by a composition of our update operations is valid, and, every valid document can be generated by a composition of our update operations (from the empty document). To accept an update, the validity of the result is checked first (without any change on the original document). Validation tests are performed incrementally, i.e., only the validity of the part of the document directly affected by the update is checked. Changes to the original document are effectively performed only when the update is accepted.


Transition Rule Incremental Validation Label Tree Tree Automaton Type Check 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    XML editor products, Available at
  2. 2.
    XML query working group, Available at
  3. 3.
    XUpdate - XML:DB Working draft, Available at
  4. 4.
    Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: Typechecking revisited. In: ACM Symposium on Principles of Database System (2001)Google Scholar
  5. 5.
    Bouchou, B., Duarte, D., Halfeld Ferrari Alves, M., Laurent, D.: Extending tree automata to model XML validation under element and attribute constraints. In: ICEIS (2003) Google Scholar
  6. 6.
    Bouchou, B., Halfeld Ferrari Alves, M., Musicante, M.A.: Tree automata to verify key constraints. In: Web and Databases (WebDB), San Diego, CA, USA (June 2003)Google Scholar
  7. 7.
    Braganholo, V.P., Davidson, S.B., Heuser, C.A.: On the updatability of XML views over relational databases. In: Web and Databases (WebDB), San Diego, CA, USA (June 2003)Google Scholar
  8. 8.
    van den Brand, M.G.J., Heering, J., Klint, P., Olivier, P.A.: Compiling rewrite systems: The ASF+SDF compiler. ACM, Transactions on Programming Languages and Systems 24 (2002)Google Scholar
  9. 9.
    Brüggeman-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation 142(2), 182–206 (1998)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.C.: Keys for XML. In: WWW10 (May 2-5, 2001)Google Scholar
  11. 11.
    Chidlovskii, B.: Using regular tree automata as XML schemas. In: Proc. IEEE Advances in Digital Libraries Conference (May 2000)Google Scholar
  12. 12.
    Cobena, G., Abiteboul, S., Marian, A.: Detecting changes in XML documents. Data Engineering (2002)Google Scholar
  13. 13.
    Kane, B., Su, H., Rundensteiner, E.A.: Consistently updating XML documents using incremental constraint check queries. In: Proceedings of WIDM 2002 (2002)Google Scholar
  14. 14.
    Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. In: ACM Symposium on Principles of Database System, pp. 11–22 (2000)Google Scholar
  15. 15.
    Neven, F.: Automata, logic and XML. In: CSL 2002 - Annual Conference of the European Association for Computer Science Logic (2002) (invited talk)Google Scholar
  16. 16.
    Papakonstantinou, Y., Vianu, V.: DTD inference for views of XML data. In: ACM Symposium on Principles of Database System, pp. 35–46 (2000)Google Scholar
  17. 17.
    Papakonstantinou, Y., Vianu, V.: Incremental validation of XML documents. In: Proceedings of the International Conference on Database Theory, ICDT (2003)Google Scholar
  18. 18.
    Suciu, D.: On database theory and XML. SIGMOD Record 30(3) (2001)Google Scholar
  19. 19.
    Tai, K.-C.: The tree-to-tree correction problem. Journal of the Association for Computing Machinery 26(3) (1979)Google Scholar
  20. 20.
    Tatarinov, I., Ives, Z.G., Halevy, A.Y., Weld, D.S.: Updating XML. In: ACM SIGMOD. ACM, New York (2001)Google Scholar
  21. 21.
    Thomas, W.: Automata of infinite objects. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Elsevier, Amsterdam (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Béatrice Bouchou
    • 1
  • Mírian Halfeld Ferrari Alves
    • 1
  1. 1.Laboratoire d’Informatique, Antenne Universitaire de BloisUniversité de ToursBloisFrance

Personalised recommendations