Sound Ranking algorithms for XML search

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

Sound Ranking algorithms for XML search

Files

sound_ranking.pdf(130.36 KB)

Date

2008

Authors

Hiemstra, Djoerd

Klinger, Stefan

Rode, Henning

Flokstra, Jan

Apers, Peter

Publication type

Contribution to a conference collection

Published in

Proceedings of the SIGIR 2008 Workshop on Focused Retrieval, held in Singapore, 24 July 2008 / Trotman, Andrew et al. (ed.). - Dunedin : Dept. of Computer Science; University of Otago, 2008. - pp. 15-21

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 not sound. We report the behaviour 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.

Subject (DDC)

004 Computer Science

Conference

SIGIR, Jul 24, 2008, Singapore

Cite This

ISO 690

HIEMSTRA, Djoerd, Stefan KLINGER, Henning RODE, Jan FLOKSTRA, Peter APERS, 2008. Sound Ranking algorithms for XML search. SIGIR. Singapore, Jul 24, 2008. In: TROTMAN, Andrew, ed. and others. Proceedings of the SIGIR 2008 Workshop on Focused Retrieval, held in Singapore, 24 July 2008. Dunedin:Dept. of Computer Science; University of Otago, pp. 15-21

BibTex

@inproceedings{Hiemstra2008Sound-3033,
  year={2008},
  title={Sound Ranking algorithms for XML search},
  publisher={Dept. of Computer Science; University of Otago},
  address={Dunedin},
  booktitle={Proceedings of the SIGIR 2008 Workshop on Focused Retrieval, held in Singapore, 24 July 2008},
  pages={15--21},
  editor={Trotman, Andrew},
  author={Hiemstra, Djoerd and Klinger, Stefan and Rode, Henning and Flokstra, Jan and Apers, Peter}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/3033">
    <dc:contributor>Flokstra, Jan</dc:contributor>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Rode, Henning</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dc:date>
    <dc:creator>Klinger, Stefan</dc:creator>
    <dc:creator>Apers, Peter</dc:creator>
    <dcterms:bibliographicCitation>Publ. in: Proceedings of the SIGIR 2008 Workshop on Focused Retrieval, held in Singapore, 24 July 2008 / Andrew Trotman ... (eds.). Dunedin: Dept. of Computer Science, University of Otago, 2008, pp. 15-21</dcterms:bibliographicCitation>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:contributor>Apers, Peter</dc:contributor>
    <dcterms:issued>2008</dcterms:issued>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Rode, Henning</dc:creator>
    <dc:creator>Flokstra, Jan</dc:creator>
    <dcterms:abstract xml:lang="eng">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 not sound. We report the behaviour 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.</dcterms:abstract>
    <dc:contributor>Klinger, Stefan</dc:contributor>
    <dc:language>eng</dc:language>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/3033"/>
    <dcterms:title>Sound Ranking algorithms for XML search</dcterms:title>
    <dc:rights>terms-of-use</dc:rights>
    <dc:creator>Hiemstra, Djoerd</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3033/1/sound_ranking.pdf"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-23T10:15:51Z</dcterms:available>
    <dc:contributor>Hiemstra, Djoerd</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/3033/1/sound_ranking.pdf"/>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

Yes