Search

Currently, the top k query algorithms about the uncertain XML data can not deal with continuous uncertain data. The SPCProTJFast algorithm is proposed, which improves the traditional merging algorithm, combines with continuous uncertain data filtering methods, implements the top-k query algorithm over continuous uncertain XML data. In order to avoid the impact of too small probability limit on filtering effect, the HPCProTJFast algorithm is proposed, which delays the handling of continuous types of nodes and visits the continuous nodes only when the entire twig that meets the probability condition are acquired. Experimental results show that, in terms of the execution time and the filtration efficiency, these two algorithms are more efficient than the ProTJFast algorithm that deals with continuous uncertain data directly, and the HPCProTJFast algorithm is the most efficient. [ABSTRACT FROM AUTHOR]