Treating structural conditions included in an XQuery Full- Text expression as desiderata rather than mandatory constraints 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 threshold approach 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 Distance and Comparison Satis- faction Ratio, for calculating the structural score of a tree that partially satisfies conditions over tree structure and element values.
Ranking for Approximated XQuery Full-T ext Queries / G. Buratti; D. Montesi. - STAMPA. - 5071:(2008), pp. 165-176. (Intervento presentato al convegno 25nd British National Conference on Databases, BNCOD 25 tenutosi a Cardiff nel From 7th to 10th of July 2008).
Ranking for Approximated XQuery Full-T ext Queries
BURATTI, GIACOMO;MONTESI, DANILO
2008
Abstract
Treating structural conditions included in an XQuery Full- Text expression as desiderata rather than mandatory constraints 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 threshold approach 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 Distance and Comparison Satis- faction Ratio, for calculating the structural score of a tree that partially satisfies conditions over tree structure and element values.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.