Sound ranking algorithms for XML search in PF/Tijah
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.
|Dagstuhl Seminar Proceedings|
|Ranked XML Querying 2008|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Hiemstra, D. (Djoerd), Klinger, S, Rode, H, Flokstra, J. (Jan), & Apers, P.M.G. (2008). Sound ranking algorithms for XML search in PF/Tijah. In Dagstuhl Seminar Proceedings. doi:10.4230/DagSemProc.08111.4