ACM Home Page
Please provide us with feedback. Feedback
Dependable cardinality forecasts for XQuery
Full text PdfPdf (1.56 MB)
Source
Proceedings of the VLDB Endowment archive
Volume 1 ,  Issue 1  (August 2008) table of contents
SESSION: XML databases table of contents
Pages 463-477  
Year of Publication: 2008
ISSN:2150-8097
Authors
Jens Teubner  IBM Watson, Hawthorne, NY
Torsten Grust  TU München, Munich, Germany
Sebastian Maneth  NICTA and UNSW, Sydney, Australia
Sherif Sakr  NICTA and UNSW, Sydney, Australia
Publisher
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 45,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1453856.1453908
What is a DOI?

ABSTRACT

Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By basing the estimation on a relational representation of the XQuery syntax, we show how existing cardinality estimation techniques for XPath and proven relational estimation machinery can play together to yield dependable forecasts for arbitrary XQuery (sub)expressions. Our approach benefits from a light-weight form of data flow analysis. Abstract domain identifiers guide our query analyzer through the estimation process and allow for informed decisions even in case of deeply nested XQuery expressions. A variant of projection paths [15] provides a versatile interface into which existing techniques for XPath cardinality estimation can be plugged in seamlessly. We demonstrate an implementation of this interface based on data guides. Experiments show how our approach can equally cope with both, structure-and value-based queries. It is robust with respect to intermediate estimation errors, from which we typically found our implementation to recover gracefully.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
D. Berleant. Automatically Verified Reasoning with Both Intervals and Probability Density Functions. Interval Computations, No. 2, 1993.
 
4
S. Boag, D. Chamberlin, M. F. Fernández, D. Florescu, J. Robie, and J. Siméon. XQuery 1.0: An XML Query Language. W3C Recommendation, 2007.
5
 
6
Don Chamberlin, Peter Fankhauser, Daniela Florescu, Massimo Marchiori, and Jonathan Robie. XML Query Use Cases. W3C Working Group Note, 2007.
 
7
D. Draper, P. Fankhauser, M. F. Fernández, A. Malhotra, K. Rose, M. Rys, J. Siméon, and P. Wadler. XQuery 1.0 and XPath 2.0 Formal Semantics. W3C Recommendation, 2007.
 
8
D. K. Fisher and S. Maneth. Structural Selectivity Estimation for XML Documents. In Proc. ICDE, 2007.
 
9
 
10
T. Grust. Purely Relational FLWORs. In Proc. XIME-P, 2005.
 
11
 
12
T. Grust and J. Teubner. Relational Algebra: Mother Tongue---XQuery: Fluent. In Proc. of the 1st Twente Data Management Workshop (TDM), 2004.
 
13
International Business Machines Corp. (IBM). DB2 Version 9 XML Guide, 2006.
 
14
 
15
16
 
17
 
18
C. Sartiani. A General Framework for Estimating XML Query Cardinality. In Proc. DBPL, 2003.
 
19
20

Collaborative Colleagues:
Jens Teubner: colleagues
Torsten Grust: colleagues
Sebastian Maneth: colleagues
Sherif Sakr: colleagues