Abstract
XQuery Full-Text is the proposed standard language for querying XML documents using either standard or full-text conditions; while full-text conditions can have a boolean or a ranked semantics, standard conditions must be satisfied for an element to be returned. This paper proposes a more general formal model that considers structural, value-based and full-text conditions as desiderata rather than mandatory constraints. The goal is achieved defining a set of relaxation operators that, given a path expression or a selection condition, return a set of relaxed path expressions or selection conditions. Algebraic approximated operators are defined for representing typical queries; they return elements that perfectly respect the conditions, as well as elements that answer to a relaxed version of the original query. A score reflecting the level of satisfaction of the original query is assigned to each result.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W3C: XQuery 1.0: An XML Query Language, W3C Recommendation (2007), http://www.w3.org/TR/xquery/
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)
INEX: INitiative for the Evaluation of XML Retrieval (2006), http://inex.is.informatik.uni-duisburg.de/2006/
W3C: XQuery 1.0 and XPath 2.0 Full-Text, W3C Working Draft (2007), http://www.w3.org/TR/xquery-full-text/
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)
Princeton University, C.S.L.: Wordnet (2007), http://wordnet.princeton.edu/
Amer-Yahia, S., Lakshmanan, L.V.S., Pandit, S.: FleXPath: Flexible Structure and Full-Text Querying for XML. In: SIGMOD, pp. 83–94 (2004)
Theobald, A., Weikum, G.: The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490, pp. 477–495. Springer, Heidelberg (2002)
Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., Toman, D.: Structure and Content Scoring for XML. In: VLDB, pp. 361–372 (2005)
Marian, A., Amer-Yahia, S., Koudas, N., Srivastava, D.: Adaptive Processing of Top-K Queries in XML. In: ICDE, pp. 162–173 (2005)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10, 707–710 (1966)
Fagin, R., Wimmers, E.L.: A Formula for Incorporating Weights into Scoring Rules. Theoretical Computer Science 239, 309–338 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buratti, G., Montesi, D. (2008). Approximation and Scoring for XML Data Management. In: Filipe, J., Shishkov, B., Helfert, M., Maciaszek, L.A. (eds) Software and Data Technologies. ICSOFT ENASE 2007 2007. Communications in Computer and Information Science, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88655-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-88655-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88654-9
Online ISBN: 978-3-540-88655-6
eBook Packages: Computer ScienceComputer Science (R0)