Effective Keyword Search for Precise Return Information over XML Documents

Meaningful and useful return information is extraordinary important for information retrieval and XML keyword search. In this work, based on analysis the structure of XML document, we propose an algorithm to classify return matched nodes, we present formal analysis on LCA (lowest common ancestor) nodes ranking and LCA sub tree refining to obtain precise return information. Experimental studies show the effectiveness of the proposed algorithm.