An Efficient Algorithm for Meaningful SLCA in XML Keyword Search

The study on XML keyword search gradually becomes the focus of information retrieval. Most previous XML keyword search algorithms are based on SLCA (smallest lowest common ancestor), but in the process of keyword search, we discover that some weakness or flaw exists in SLCA, it is summarized as follows: (1) the query result is absolutely accurate but it is meaningless. (2) The return information can´t satisfy user´s search needs. (3) A huge number of trivial results are returned, make user difficult to distinguish them. In order to solve the problems given above, we propose a simplified algorithm for meaningful SLCA, experiment result shows that the algorithm is efficient, and it achieves a good balance in the precision and the recall.