Ranking for Approximated XQuery Full-Text Queries

  • Giacomo Buratti
  • Danilo Montesi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5071)


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 Satisfaction Ratio, for calculating the structural score of a tree that partially satisfies conditions over tree structure and element values.


XQuery Full-Text Approximation Score Ranking Optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W3C: XQuery 1.0 and XPath 2.0 Full-Text, W3C Working Draft (2006),
  2. 2.
    INEX: INitiative for the Evaluation of XML Retrieval (2007),
  3. 3.
    Buratti, G., Montesi, D.: An Approximation-Aware Algebra for XML Full-Text Queries. In: Proceedings of ICSOFT 2007 (July 2007)Google Scholar
  4. 4.
    Trotman, A., Lalmas, M.: The Interpretation of CAS. In: Fuhr, N., Lalmas, M., Malik, S., Kazai, G. (eds.) INEX 2005. LNCS, vol. 3977, pp. 58–71. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., Toman, D.: Structure and Content Scoring for XML. In: Proceedings of VLDB 2005, pp. 361–372 (2005)Google Scholar
  6. 6.
    Marian, A., Amer-Yahia, S., Koudas, N., Srivastava, D.: Adaptive Processing of Top-K Queries in XML. In: Proceedings of ICDE 2005, pp. 162–173 (2005)Google Scholar
  7. 7.
    Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)Google Scholar
  8. 8.
    Trotman, A., Sigurbjörnsson, B.: Narrowed Extended XPath I (NEXI). In: Fuhr, N., Lalmas, M., Malik, S., Szlávik, Z. (eds.) INEX 2004. LNCS, vol. 3493, pp. 16–40. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Theobald, M., Schenkel, R., Weikum, G.: An Efficient and Versatile Query Engine for TopX Search. In: Proceedings of VLDB 2005, pp. 625–636 (2005)Google Scholar
  10. 10.
    Fagin, R., Wimmers, E.L.: A Formula for Incorporating Weights into Scoring Rules. Theoretical Computer Science 239(2), 309–338 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10(8), 707–710 (1966)MathSciNetGoogle Scholar
  12. 12.
    Buratti, G.: A Model and an Algebra for Semi-Structured and Full-Text Queries (Ph.D. Thesis). Technical Report UBLCS-2007-03, University of Bologna (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Giacomo Buratti
    • 1
  • Danilo Montesi
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of CamerinoCamerinoItaly
  2. 2.Department of Computer ScienceUniversity of BolognaBolognaItaly

Personalised recommendations