|
|
|
     |
                                     |
Return to XML and Text
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-suited for natural language text, with standard "database style" query evaluation, which handles structured queries efficiently. Relevance scoring is central to information retrieval. In the case of XML, this operation becomes more complex because the data required for scoring could reside not directly in an element itself but also in its descendant elements. In this paper, we propose a bulk-algebra, TIX, and describe how it can be used as a basis for integrating information retrieval techniques into a standard pipelined database query evaluation engine. We develop new evaluation strategies essential to obtaining good performance, including a stack-based TermJoin algorithm for efficiently scoring composite elements. We report results from an extensive experimental evaluation, which show, among other things, that the new TermJoin access method outperforms a direct implementation of the same functionality using standard operators by a large factor.
@inproceedings {DBLP:conf/sigmod/Al-KhalifaYJ03, author = {Shurug Al-Khalifa and Cong Yu and H. V. Jagadish}, booktitle = {SIGMOD Conference}, title = {Querying Structured Text in an XML Database.}, pages = {4-15}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#Al-KhalifaYJ03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r01p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
