XKMis: effective and efficient keyword search in XML databases

ACM International Conference Proceeding Series ACM Press 2009
Publication Type:
Conference Proceeding
International Database Engineering and Applications Symposium (IDEAS 2009), 2009, pp. 121 - 130
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2009000964.pdf645.66 kB
Adobe PDF
We present XKMis, a system for keyword search in xml documents. Unlike previous work, our method is not based on the lowest common ancestor (LCA) or its variant, rather we divide the nodes into meaningful and self-containing in- formation segments, called minimal information segments (MISs), and return MIS-subtrees which consist of MISs that are logically connected by the keywords. The MIS-subtrees are closer to what the user wants. The MIS-subtrees enable us to use the region code of xml trees to develop an algorithm for the search which is more efficient especially for large xml trees. We report our experiment results, which verify the better effectiveness and efficiency of our system.
Please use this identifier to cite or link to this item: