Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08111.4
URN: urn:nbn:de:0030-drops-15334
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1533/
Hiemstra, Djoerd ; Klinger, Stefan ; Rode, Henning ; Flokstra, Jan ; Apers, Peter
Sound ranking algorithms for XML search in PF/Tijah
| pdf-format: |
|
Abstract
We argue that ranking algorithms for XML should reflect the actualcombined 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.
BibTeX - Entry
@InProceedings{hiemstra_et_al:DagSemProc.08111.4,
author = {Hiemstra, Djoerd and Klinger, Stefan and Rode, Henning and Flokstra, Jan and Apers, Peter},
title = {{Sound ranking algorithms for XML search in PF/Tijah}},
booktitle = {Ranked XML Querying},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8111},
editor = {Sihem Amer-Yahia and Divesh Srivastava and Gerhard Weikum},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2008/1533},
URN = {urn:nbn:de:0030-drops-15334},
doi = {10.4230/DagSemProc.08111.4},
annote = {Keywords: XML Information Retrieval, XQuery Full-Text}
}
| Keywords: | XML Information Retrieval, XQuery Full-Text | |
| Seminar: | 08111 - Ranked XML Querying | |
| Issue date: | 2008 | |
| Date of publication: | 24.06.2008 |
