Ranking for Approximated XQuery Full-Text Queries

Authors:
Giacomo Buratti;Danilo Montesi
Affiliations:
Department of Mathematics and Computer Science, University of Camerino, Camerino, Italy;Department of Computer Science, University of Bologna, Bologna, Italy
Venue:
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Year:
2008

Citing 7
Cited 0

A formula for incorporating weights into scoring rules

Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Modern Information Retrieval

Modern Information Retrieval
Adaptive Processing of Top-k Queries in XML

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Structure and content scoring for XML

VLDB '05 Proceedings of the 31st international conference on Very large data bases
An efficient and versatile query engine for TopX search

VLDB '05 Proceedings of the 31st international conference on Very large data bases
The interpretation of CAS

INEX'05 Proceedings of the 4th international conference on Initiative for the Evaluation of XML Retrieval
Narrowed extended XPath i (NEXI)

INEX'04 Proceedings of the Third international conference on Initiative for the Evaluation of XML Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

Treating structural conditions included in an XQuery Full-Text expression as desideratarather than mandatoryconstraints could be beneficial for better answering user's informational needs. Using an approximated semantics requires however a mechanism for calculating a score for each resulting tree, and an algorithm for efficiently finding the best results. Both these issues are explored in this paper. We present algorithms for query evaluation that uses a thresholdapproach in order to improve performance; the algorithms rely on some properties of the functions used to calculate the score. Moreover, we propose a method, based on the new concepts of Path Edit Distanceand Comparison Satisfaction Ratio, for calculating the structural score of a tree that partially satisfies conditions over tree structure and element values.