Abstract
Recently, keyword search has attracted a great deal of attention in an XML database. In many applications which backend data source powered by an XML database management system, keyword search because important to query XML data if the user does not know the structure or only knows the structure of XML partially. Given a keyword query, existing approaches first compute the lowest common ancestors (LCAs) or their variants of XML elements that contain the input keywords, and then identify the subtrees rooted at the LCAs as the answer. But this method doesn't satisfy the user's intention well enough. For users, information containing some keywords (not all keywords) may also be useful. In this paper, we solve this problem through applying relax structural queries during the XML keyword search procedure, and progressively to obtain the top-k answers of keyword proximity search though analyzing the semantic and structural information of the queries. We propose a transformation framework to derive the structural queries by analyzing the given keyword and the structural information of XML database. In addition, we propose a scoring method considering user's preference, and at last, we design an architecture (Rtop-k) to adaptively and efficiently identify the top-k relevant answers of a query. The performance of the technique as well as the recall and the precision were measured experimentally. These experiments indicate that our system is efficient enough and ranks quality results highly.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call