Efficient Incremental Validation of XML Documents

  • Authors:
  • Denilson Barbosa;Alberto O. Mendelzon;Leonid Libkin;Laurent Mignet;Marcelo Arenas

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • ICDE '04 Proceedings of the 20th International Conference on Data Engineering
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss incremental validation of XML documentswith respect to DTDs and XML Schema definitions. We considerinsertions and deletions of subtrees, as opposed to leafnodes only, and we also consider the validation of ID andIDREF attributes. For arbitrary schemas, we give a worst-casen log n time and linear space algorithm, and showthat it often is far superior to revalidation from scratch. Wepresent two classes of schemas, which capture most real-lifeDTDs, and show that they admit a logarithmic timeincremental validation algorithm that, in many cases, requiresonly constant auxiliary space. We then discuss animplementation of these algorithms that is independent of,and can be customized for different storage mechanismsfor XML. Finally, we present extensive experimental resultsshowing that our approach is highly efficient and scalable.