|
|
|
     |
                                     |
Return to XML and Text
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML documents, as opposed to (conceptually) flat HTML documents, introduces many new challenges. First, XML keyword search queries do not always return entire documents, but can return deeply nested XML elements that contain the desired keywords. Second, the nested structure of XML implies that the notion of ranking is no longer at the granularity of a document, but at the granularity of an XML element. Finally, the notion of keyword proximity is more complex in the hierarchical XML data model. In this paper, we present the XRANK system that is designed to handle these novel features of XML keyword search. Our experimental results show that XRANK offers both space and performance benefits when compared with existing approaches. An interesting feature of XRANK is that it naturally generalizes a hyperlink based HTML search engine such as Google. XRANK can thus be used to query a mix of HTML and XML documents.
@inproceedings {DBLP:conf/sigmod/GuoSBS03, author = {Lin Guo and Feng Shao and Chavdar Botev and Jayavel Shanmugasundaram}, booktitle = {SIGMOD Conference}, title = {XRANK: Ranked Keyword Search over XML Documents.}, pages = {16-27}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#GuoSBS03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r01p02.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
