Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient algorithms for minimizing tree pattern queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Texquery: a full-text search extension to xquery
Proceedings of the 13th international conference on World Wide Web
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
Articulating information needs in XML query languages
ACM Transactions on Information Systems (TOIS)
Evaluating XML retrieval effectiveness at INEX
ACM SIGIR Forum
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Introduction to Information Retrieval
Introduction to Information Retrieval
RRSi: indexing XML data for proximity twig queries
Knowledge and Information Systems
CoXML: a cooperative XML query answering system
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Narrowed extended XPath i (NEXI)
INEX'04 Proceedings of the Third international conference on Initiative for the Evaluation of XML Retrieval
| Hi-index | 0.00 |
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an answer. But this requirement may lead to undesirable behavior of XML retrieval systems: two queries which are intuitively (e.g., without ranking) equivalent return differently ordered lists of elements. We show that the best performing XML retrieval semantics has this behavior. We also show how minimization of tree patterns can efficiently solve this problem.