Minimum tree edit distance between XML and Probabilistic XML documents

Abstract

A Probabilistic XML document is a data model representing data as a probabilistic distribution over ordinary XML documents, which are called possible worlds. This paper studies the problem of tree edit distance between an XML document and a probabilistic XML document. In particular, We define a minimum tree edit distance between an XML document and the possible worlds of a probabilistic XML document. We investigate the problem and propose an algorithm for computing the minimum tree edit distance, which runtime is polynomial in the size of the probabilistic XML document. Finally, our experimental evaluation on synthetic XML documents confirms our analytic results.