Algorithm on Top-k Keyword Search of Uncertain XML
Li-Yong Zhou, Xiao-Lin Zhang
Available Online December 2015.
- https://doi.org/10.2991/icmmcce-15.2015.313How to use a DOI?
- uncertain XML; LRCT; Top-k; keyword search
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Li-Yong Zhou AU - Xiao-Lin Zhang PY - 2015/12 DA - 2015/12 TI - Algorithm on Top-k Keyword Search of Uncertain XML BT - Proceedings of the 4th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering 2015 PB - Atlantis Press SN - 2352-538X UR - https://doi.org/10.2991/icmmcce-15.2015.313 DO - https://doi.org/10.2991/icmmcce-15.2015.313 ID - Zhou2015/12 ER -