Abstract
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count and sum, sequence generation, node construction, position information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 79–95. Springer, Heidelberg (2002)
Boag, S., Chamberlin, D., Fernández, M., Florescu, D., Robie, J., Siméon, J.: XQuery 1.0: An XML query language. W3C Working Draft (2005), Available at http://www.w3.org/TR/xquery/
Draper, D., Frankhauser, P., Fernández, M., Malhotra, A., Rose, K., Rys, M., Siméon, J., Wadler, P.: XQuery 1.0 and XPath 2.0 formal semantics. W3C Working Draft (2005), Available at http://www.w3.org/TR/xquery-semantics/
Gottlob, G., Koch, C., Pichler, R.: The complexity of XPath query evaluation. In: PODS 2003, pp. 179–190 (2003)
Hidders, J., Paredaens, J., Vercammen, R., Demeyer, S.: A light but formal introduction to XQuery. In: Bellahsène, Z., Milo, T., Rys, M., Suciu, D., Unland, R. (eds.) XSym 2004. LNCS, vol. 3186, pp. 5–20. Springer, Heidelberg (2004)
Hidders, J., Paredaens, J., Vercammen, R., Marrara, S.: Expressive power of recursion and aggregates in XQuery. Technical Report TR2005-05, University of Antwerp (2005), Available at http://www.adrem.ua.ac.be/pub/TR2005-05.pdf
Kay, M., Walsh, N., Zongaro, H.: XSLT 2.0 and XQuery 1.0 serialization. W3C Working Draft (2005), Available at http://www.w3.org/TR/xslt-xquery-serialization
Kepser, S.: A simple proof of the Turing-completeness of XSLT and XQuery. In: Usdin, T. (ed.) Extreme Markup Languages 2004. IDEAlliance (2004), Available at http://www.mulberrytech.com/Extreme/Proceedings/html/2004/Kepser01/EML2004Kepser01.html
Koch, C.: On the complexity of nonrecursive XQuery and functional query languages on complex values. In: PODS 2005, pp. 84–97 (2005)
Le Page, W., Hidders, J., Michiels, P., Paredaens, J., Vercammen, R.: On the expressive power of node construction in XQuery. In: WebDB 2005, pp. 85–90 (2005), Available at http://webdb2005.uhasselt.be/webdb05_eproceedings.pdf
Libkin, L.: Expressive power of SQL. Theoretical Computer Science 296(3), 379–404 (2003)
Paredaens, J.: On the expressive power of the relational algebra. Information Processing Letters 7(2), 107–111 (1978)
Vansummeren, S.: Deciding well-definedness of XQuery fragments. In: PODS 2005, pp. 37–48 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hidders, J., Marrara, S., Paredaens, J., Vercammen, R. (2005). On the Expressive Power of XQuery Fragments. In: Bierman, G., Koch, C. (eds) Database Programming Languages. DBPL 2005. Lecture Notes in Computer Science, vol 3774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11601524_10
Download citation
DOI: https://doi.org/10.1007/11601524_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30951-2
Online ISBN: 978-3-540-31445-5
eBook Packages: Computer ScienceComputer Science (R0)