Sound ranking algorithms for XML search

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
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
StatePublished - 24 Jul 2008
Event2008 SIGIR Workshop on Focused Retrieval - Singapore, Singapore
Duration: 24 Jul 200824 Jul 2008

Publication series

Name
PublisherUniversity of Otago
No.302

Workshop

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

Fingerprint

XML
Acoustic waves
Semantics

Keywords

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

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.
Hiemstra, Djoerd ; Klinger, S. ; Rode, H. ; Flokstra, Jan ; Apers, Peter M.G./ Sound ranking algorithms for XML search. Proceedings of the 2nd SIGIR workshop on Focused Retrieval. Dunedin, New Zealand : University of Otago, 2008. pp. 15-21
@inproceedings{0cc985f69f294bde97c4bf4d7f18844a,
title = "Sound ranking algorithms for XML search",
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.",
keywords = "DB-XMLIR: XML INFORMATION RETRIEVAL, IR-64825, METIS-251027, EWI-12918",
author = "Djoerd Hiemstra and S. Klinger and H. Rode and Jan Flokstra and Apers, {Peter M.G.}",
year = "2008",
month = "7",
day = "24",
language = "English",
isbn = "978-0-473-13468-6",
publisher = "University of Otago",
number = "302",
pages = "15--21",
booktitle = "Proceedings of the 2nd SIGIR workshop on Focused Retrieval",

}

Hiemstra, D, Klinger, S, Rode, H, Flokstra, J & Apers, PMG 2008, Sound ranking algorithms for XML search. in Proceedings of the 2nd SIGIR workshop on Focused Retrieval. University of Otago, Dunedin, New Zealand, pp. 15-21, 2008 SIGIR Workshop on Focused Retrieval, Singapore, Singapore, 24/07/08.

Sound ranking algorithms for XML search. / Hiemstra, Djoerd; Klinger, S.; Rode, H.; Flokstra, Jan; Apers, Peter M.G.

Proceedings of the 2nd SIGIR workshop on Focused Retrieval. Dunedin, New Zealand : University of Otago, 2008. p. 15-21.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Sound ranking algorithms for XML search

AU - Hiemstra,Djoerd

AU - Klinger,S.

AU - Rode,H.

AU - Flokstra,Jan

AU - Apers,Peter M.G.

PY - 2008/7/24

Y1 - 2008/7/24

N2 - 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.

AB - 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.

KW - DB-XMLIR: XML INFORMATION RETRIEVAL

KW - IR-64825

KW - METIS-251027

KW - EWI-12918

M3 - Conference contribution

SN - 978-0-473-13468-6

SP - 15

EP - 21

BT - Proceedings of the 2nd SIGIR workshop on Focused Retrieval

PB - University of Otago

CY - Dunedin, New Zealand

ER -

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