Exploiting the Relationship between Keywords for Effective XML Keyword Search

Springer Berlin Heidelberg
Publication Type:
Conference Proceeding
Lecture Notes in Computer Science, 2013, 8133 (1), pp. 232 - 245
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013003718OK.pdf322.16 kB
Adobe PDF
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword queries. In this paper, we tackle the keyword ambiguity problem by exploiting the relationship between keywords in a query. We propose an approach which infers and ranks a set of likely search intentions. Extensive experiments verified the better effectiveness of our approach than existing systems.
Please use this identifier to cite or link to this item: