Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Jagadish, L. Lakshmanan, D. Srivastava, Keith Thompson (2001)
TAX: A Tree Algebra for XML
Y. Ioannidis (1993)
Universality of Serial Histograms
S. Sakr (2007)
Cardinality-aware and purely relational implementation of an XQuery processor
(2003)
XQuery rewriting at the algebraic level ” , Trends in XML Technology for the Global Information Infrastructure , a special issue of Journal of Computer Systems
Roy Goldman, J. Widom (1997)
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
J. Freire, J. Haritsa, Maya Ramanath, Prasan Roy, Jérôme Siméon (2002)
StatiX: making XML count
J. Teubner (2006)
Pathfinder: XQuery Compilation Techniques for Relational Database Targets
(2006)
XQuery 1.0 and XPath 2.0 Data Model (XDM)
Matthias Nicola, I. Kogan, Berni Schiefer (2007)
An XML transaction processing benchmark
Ning Zhang, M. Özsu, Ashraf Aboulnaga, I. Ilyas (2006)
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries22nd International Conference on Data Engineering (ICDE'06)
Lipyeow Lim, Min Wang, S. Padmanabhan, J. Vitter, Ronald Parr (2002)
XPathLearner: An On-line Self-Tuning Markov Histogram for XML Path Selectivity Estimation
(2006)
World Wide Web Consortium, Extensible Markup Language (XML) 1.0
Torsten Grust, Manuel Mayr, J. Rittinger, S. Sakr, J. Teubner (2007)
A SQL: 1999 code generator for the pathfinder xquery compiler
Stelios Paparizos, S. Al-Khalifa, H. Jagadish, Andrew Nierman, Yuqing Wu (2003)
A Physical Algebra for XML
Torsten Grust (2005)
Purely Relational FLWORs
D. Fisher, S. Maneth (2007)
Structural Selectivity Estimation for XML Documents2007 IEEE 23rd International Conference on Data Engineering
P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, Thomas Price (1979)
Access path selection in a relational database management system
B. Yao, M. Özsu, John Keenleyside (2002)
XBench - A Family of Benchmarks for XML DBMSs
J. Rittinger (2005)
Pathfinder/MonetDB : a Relational Runtime for XQuery
Hanyu Li, M. Lee, W. Hsu, G. Cong (2006)
An Estimation System for XPath Expressions22nd International Conference on Data Engineering (ICDE'06)
C. Sartiani (2003)
A General Framework for Estimating XML Query Cardinality
H. Zhang, F.W. Tompa
XQuery rewriting at the algebraic level
P. Boncz, Torsten Grust, M. Keulen, S. Manegold, J. Rittinger, J. Teubner (2006)
MonetDB/XQuery: a fast XQuery processor powered by a relational engineProceedings of the 2006 ACM SIGMOD international conference on Management of data
Ashraf Aboulnaga, Alaa Alameldeen, J. Naughton (2001)
Estimating the Selectivity of XML Path Expressions for Internet Scale Applications
M. Brantner, S. Helmer, C. Kanne, G. Moerkotte (2005)
Full-fledged algebraic XPath processing in Natix21st International Conference on Data Engineering (ICDE'05)
V. Poosala, Y. Ioannidis, P. Haas, E. Shekita (1996)
Improved histograms for selectivity estimation of range predicates
P. Boncz (2002)
Monet; a next-Generation DBMS Kernel For Query-Intensive Applications
S. Boag, D. Chamberlin, M.F. Fernández, D. Florescu, J. Robie, J. Siméon
XQuery 1.0: an XML query language – world wide web consortium proposed recommendation
C. Sartiani, A. Albano (2002)
Yet another query algebra for XML dataProceedings International Database Engineering and Applications Symposium
Zhimin Chen, H. Jagadish, L. Lakshmanan, Stelios Paparizos (2003)
From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery
C. Ré, Jérôme Siméon, M. Fernández (2006)
A Complete and Efficient Algebraic Compiler for XQuery22nd International Conference on Data Engineering (ICDE'06)
Torsten Grust (2002)
Accelerating XPath location steps
A. Schmidt, F. Waas, M. Kersten, M. Carey, I. Manolescu, R. Busse (2002)
XMark: A Benchmark for XML Data Management
M.F. Fernández, A. Malhotra, J. Marsh, M. Nagy, N. Walsh
XQuery 1.0 and XPath 2.0 data model (XDM) – world wide web consortium proposed recommendation
Torsten Grust, S. Sakr, J. Teubner (2004)
XQuery on SQL Hosts
Wei Wang, H. Jiang, Hongjun Lu, J. Yu (2004)
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
A. Schmidt, F. Waas, M. Kersten, M. Carey, I. Manolescu, R. Busse (2002)
A Benchmark for XML Data Management
(1993)
Automatically verified reasoning with both intervals and probability density functions
Timo Böhme, E. Rahm (2001)
XMach-1: A Benchmark for XML Data Management
Purpose – Estimating the sizes of query results and intermediate results is crucial to many aspects of query processing. All database systems rely on the use of cardinality estimates to choose the cheapest execution plan. In principle, the problem of cardinality estimation is more complicated in the Extensible Markup Language (XML) domain than the relational domain. The purpose of this paper is to present a novel framework for estimating the cardinality of XQuery expressions as well as their sub‐expressions. Additionally, this paper proposes a novel XQuery cardinality estimation benchmark. The main aim of this benchmark is to establish the basis of comparison between the different estimation approaches in the XQuery domain. Design/methodology/approach – As a major innovation, the paper exploits the relational algebraic infrastructure to provide accurate estimation in the context of XML and XQuery domains. In the proposed framework, XQuery expressions are translated into an equivalent relational algebraic plans and then using a well defined set of inference rules and a set of special properties of the algebraic plan, this framework is able to provide high‐accurate estimation for XQuery expressions. Findings – This paper is believed to be the first which provides a uniform framework to estimate the cardinality of more powerful XML querying capabilities using XQuery expressions as well as their sub‐expressions. It exploits the relational algebraic infrastructure to provide accurate estimation in the context of XML and XQuery domains. Moreover, the proposed framework can act as a meta‐model through its ability to incorporate different summarized XML structures and different histogram techniques which allows the model designers to achieve their targets by focusing their effort on designing or selecting the adequate techniques for them. In addition, this paper proposes benchmark for XQuery cardinality estimation systems. The proposed benchmark distinguishes itself from the other existing XML benchmarks in its focus on establishing the basis for comparing the different estimation approaches in the XML domain in terms of their accuracy of the estimations and their completeness in handling different XML querying features. Research limitations/implications – The current status of this proposed XQuery cardinality estimations framework does not support the estimation of the queries over the order information of the source XML documents and does not support non‐numeric predicates. Practical implications – The experiments of this XQuery cardinality estimation system demonstrate its effectiveness and show high‐accurate estimation results. Utilizing the cardinality estimation properties during the SQL translation of XQuery expression results in an average improvement of 20 percent on the performance of their execution times. Originality/value – This paper presents a novel framework for estimating the cardinality of XQuery expressions as well as its sub‐expressions. A novel XQuery cardinality estimation benchmark is introduced to establish the basis of comparison between the different estimation approaches in the XQuery domain.
International Journal of Web Information Systems – Emerald Publishing
Published: Apr 4, 2008
Keywords: Benchmarking; Algebra; Database management; Extensible Markup Language
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.