Sound ranking algorithms for XML search in PF/Tijah

Authors Djoerd Hiemstra, Stefan Klinger, Henning Rode, Jan Flokstra, Peter Apers



PDF
Thumbnail PDF

File

DagSemProc.08111.4.pdf
  • Filesize: 140 kB
  • 12 pages

Document Identifiers

Author Details

Djoerd Hiemstra
Stefan Klinger
Henning Rode
Jan Flokstra
Peter Apers

Cite AsGet BibTex

Djoerd Hiemstra, Stefan Klinger, Henning Rode, Jan Flokstra, and Peter Apers. Sound ranking algorithms for XML search in PF/Tijah. In Ranked XML Querying. Dagstuhl Seminar Proceedings, Volume 8111, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08111.4

Abstract

We argue that 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 {em not sound}. We report the behaviour of different approaches to ranking content-and-structure que-ries 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.
Keywords
  • XML Information Retrieval
  • XQuery Full-Text

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail