On Efficient Evaluation of XML Queries

On Efficient Evaluation of XML Queries

ISBN13: 9781609605216|ISBN10: 1609605217|EISBN13: 9781609605223
DOI: 10.4018/978-1-60960-521-6.ch011
Cite Chapter Cite Chapter

MLA

Sakr, Sherif. "On Efficient Evaluation of XML Queries." Theoretical and Practical Advances in Information Systems Development: Emerging Trends and Approaches, edited by Keng Siau, IGI Global, 2011, pp. 239-293. https://doi.org/10.4018/978-1-60960-521-6.ch011

APA

Sakr, S. (2011). On Efficient Evaluation of XML Queries. In K. Siau (Ed.), Theoretical and Practical Advances in Information Systems Development: Emerging Trends and Approaches (pp. 239-293). IGI Global. https://doi.org/10.4018/978-1-60960-521-6.ch011

Chicago

Sakr, Sherif. "On Efficient Evaluation of XML Queries." In Theoretical and Practical Advances in Information Systems Development: Emerging Trends and Approaches, edited by Keng Siau, 239-293. Hershey, PA: IGI Global, 2011. https://doi.org/10.4018/978-1-60960-521-6.ch011

Export Reference

Mendeley
Favorite

Abstract

Recently, the use of XML continues to grow in popularity, large repositories of XML documents are going to emerge, and users are likely to pose increasingly more complex queries on these data sets. In 2001 XQuery is decided by the World Wide Web Consortium (W3C) as the standard XML query language. In this article, we describe the design and implementation of an efficient and scalable purely relational XQuery processor which translates expressions of the XQuery language into their equivalent SQL evaluation scripts. The experiments of this article demonstrated the efficiency and scalability of our purely relational approach in comparison to the native XML/XQuery functionality supported by conventional RDBMSs and has shown that our purely relational approach for implementing XQuery processor deserves to be pursued further.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.