Algorithm on Top-k Keyword Search of Uncertain XML

Currently, the Top-k keyword search of uncertain XML returns only the top k probability value of the root node. We need further processing to constructed the sub-tree that it meet some certain conditions. To solve this problem, this paper defines a new Top-k query semantics SRRT-Top-k that based on the minimum correlation Unicom subtree, LRCT-Top-k query returns the minimum correlation Unicom subtree of top probability value k, and presents the PLTop-k algorithm that it based on dynamic data warehouse of Keyword to process LRCT-Top-k queries. PLTop-k algorithm is only scanned once Dynamic Keyword data warehouse can be constructed to meet the sub-tree under specific conditions, and developed a filtering policy to reduce the intermediate results. The theoretical analysis and experimental results show, PLTop-k is a highly Top-k query algorithms of uncertain XML.