Sound ranking algorithms for XML search

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

13 Downloads (Pure)

Abstract

Ranking algorithms for XML should reflect the actual combined content and structure constraints of queries, while at the same time producing equal rankings for queries that are semantically equal. Ranking algorithms that produce different rankings for queries that are semantically equal are easily detected by tests on large databases: We call such algorithms not sound. We report the behavior of different approaches to ranking content-and-structure queries on pairs of queries for which we expect equal ranking results from the query semantics. We show that most of these approaches are not sound. Of the remaining approaches, only 3 adhere to the W3C XQuery Full-Text standard.
Original languageEnglish
Title of host publicationProceedings of the 2nd SIGIR workshop on Focused Retrieval
Place of PublicationDunedin, New Zealand
PublisherUniversity of Otago
Pages15-21
Number of pages7
ISBN (Print)978-0-473-13468-6
Publication statusPublished - 24 Jul 2008
Event2008 SIGIR Workshop on Focused Retrieval - Singapore, Singapore
Duration: 24 Jul 200824 Jul 2008

Publication series

Name
PublisherUniversity of Otago
Number302

Workshop

Workshop2008 SIGIR Workshop on Focused Retrieval
CountrySingapore
CitySingapore
Period24/07/0824/07/08

Keywords

  • DB-XMLIR: XML INFORMATION RETRIEVAL
  • IR-64825
  • METIS-251027
  • EWI-12918

Fingerprint Dive into the research topics of 'Sound ranking algorithms for XML search'. Together they form a unique fingerprint.

  • Cite this

    Hiemstra, D., Klinger, S., Rode, H., Flokstra, J., & Apers, P. M. G. (2008). Sound ranking algorithms for XML search. In Proceedings of the 2nd SIGIR workshop on Focused Retrieval (pp. 15-21). Dunedin, New Zealand: University of Otago.