Sublinear DTD Validity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Sublinear DTD Validity

Antoine Mbaye Ndione
  • Function : Author
  • PersonId : 919663
Aurélien Lemay
  • Function : Author
  • PersonId : 834816
Joachim Niehren


We present an efficient algorithm for testing approximate DTD validity modulo the strong tree edit distance. Our algorithm inspects XML documents in a probabilistic manner. It detects with high probability the nonvalidity of XML documents with a large fraction of errors, measured in terms of the strong tree edit distance from the DTD. The run time depends polynomially on the depth of the XML document tree but not on its size, so that it is sublinear in most cases. Therefore, our algorithm can be used to speed up exact DTD validators that run in linear time. We also prove a negative result showing that the run time of any approximate DTD validity tester must depend on the depth of the input tree.

A long version is available here.

Fichier principal
Vignette du fichier
main.pdf (323.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00803696 , version 1 (09-07-2015)


Attribution - CC BY 4.0


  • HAL Id : hal-00803696 , version 1


Antoine Mbaye Ndione, Aurélien Lemay, Joachim Niehren. Sublinear DTD Validity. 9th International Conference on. Language and Automata Theory and Applications, Mar 2015, Nice, France. ⟨hal-00803696⟩
333 View
59 Download


Gmail Facebook Twitter LinkedIn More