XIO-SLCA: Optimize SLCA for effective keyword search in XML documents

Abstract

Keyword search has attracted a great deal of attention for retrieving XML data because it is a user-friendly mechanism. In this paper, we study the problem of effective keyword search over XML documents. The paper SLCA proposed that keyword search returns the set of smallest trees, where a tree is designated as smallest if it contains no sub-tree that also contains all keywords. The paper SLCA also provided detail description of the Indexed Lookup Eager algorithm (IL) to calculate SLCA. We analyzed and experimental studied the IL algorithm of SLCA deeply, find that there are 3 bugs which should not be disregarded. This paper investigates the problems to correct the existent 3 bugs of the algorithm IL, and proposes an optimize method called XIO-SLCA to improve keyword search quality. We have conducted an extensive experimental study and the experimental results show that our proposed approach XIO-SLCA achieves both higher recall and precise when compared with the existing proposal SLCA. © 2012 Springer-Verlag.