Sublinear DTD validity

Abstract

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 (because in practice XML documents tend to be shallow). Therefore, our algorithm can be used to speed up exact dtd validators that run in linear time.