An Extended Compact TVP Index for Finding Top-k Nearest Neighbors over XML Data Tree
Given a node q and a keyword w, nearest keyword (NK) search is to find the nearest w-neighbor of q which carries the keyword w. NK search provides an approach to exploring XML query problems based on the distance between nodes, such as XPath evaluation and XML keyword search. In this paper, we propose an extended compact TVP index (ecTVP) tailored to find top-k nearest w-neighbors of a given node in XML data tree. The ecTVP index is more compact and faster to build. Both theoretical analysis and experimental result show the advantage of the ecTVP index.
Proceedings of the 13th International Conference on Web Information Systems Engineering (WISE 2012)