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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
