Tree patterns with full text search

Authors
Publication date 2010
Book title WebDB '10: Proceedings of the 13th International Workshop on the Web and Databases
ISBN
  • 9781450301862
Event 13th International Workshop on the Web and Databases (WebDB '10), Indianapolis, IN, USA
Pages (from-to) 15
Publisher New York: ACM
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract 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.
Document type Conference contribution
Language English
Published at https://doi.org/10.1145/1859127.1859147
Permalink to this page
Back