Algorithm for probabilistic XML data tree simplifying
一种概率XML数据树的化简算法*

Because the probabilistic XML data tree must have some redundant nodes, this paper presented the algorithm for probabilistic XML data tree simplifying. Based on analyzing some path types in the probabilistic XML data tree, departed the probabilistic XML data trees to the two forms that were the sparse data trees and the compact data trees. The sparse probabilistic XML data tree could be transformed to the compact one by eliminating the probability chain, computing the consistent set of the absolute path and the equivalence set of the absolute path. The theory research and experiment results show that the simplifying algorithm is effective. And it can solve the probabilistic XML data tree simplifying problem.