Abstract
In this paper, I summarize my research on optimizing XML queries. This work has two components: the first component is the definition of a logical algebra and logical optimization techniques. This algebra can be translated into different physical algebras such as native or extended-relational algebras. The second component is the design of physical storage structures and physical optimization techniques.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proc. 18th Int. Conf. on Data Engineering, pp. 141–152 (2002)
Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 310–322 (2002)
Chen, Z., Jagadish, H.V., Lakshmanan, L.V.S., Paparizos, S.: From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery. In: Proc. 29th Int. Conf. on Very Large Data Bases (2003)
Christophides, V., Cluet, S., Simeon, J.: On Wrapping Query Languages and Efficient XML Integration. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 141–152 (2000)
DeHann, D., Toman, D., Consens, M.P., ’́Ozsu, M.T.: A Comprehensive XQuery to SQL Translation using Dynamic Interval Encoding. J. ACM, 623–634 (2003)
Fankhauser, P., Fernandez, M., Malhotra, A., Rys, M., Simeon, J., Wadler, P.: XQuery 1.0 Formal Semantics. W3C Working Draft, World Wide Web Consortium (November 2004), Available at: http://www.w3.org/TR/query-semantics/
Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. In: Proc. 28th Int. Conf. on Very Large Data Bases, pp. 95–106 (2002)
Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D., Thompson, K.: TAX: A Tree Algebra for XML. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, p. 149. Springer, Heidelberg (2002)
Kepser, S.: A Proof of the Turing-completeness of XSLT and XQuery. Technical report, University of Tübingen (2002)
Knuth, D.E.: The Art of Computer Programming, 3rd edn., vol. 1. Addison-Wesley, Reading (1997)
Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: Proc. 21st ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 39–53 (2002)
Simeon, J., Fernandez, M.: Galax (2004), Available at: http://www-db-out.bell-labs.com/galax/
Wu, Y., Patel, J.M., Jagadish, H.V.: Structural Join Order Selection for XML Query Optimization. In: Proc. 19th Int. Conf. on Data Engineering (2003)
Zhang, C., Naughton, J., Dewitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 425–436 (2001)
Zhang, N., Kacholia, V., Özsu, M.T.: A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML. In: Proc. 20th Int. Conf. on Data Engineering (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, N. (2004). XML Query Processing and Optimization. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30192-9_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23305-3
Online ISBN: 978-3-540-30192-9
eBook Packages: Computer ScienceComputer Science (R0)