東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

XML query processing and optimization.

Zhang, Hui.

FindBook

Google Book

Amazon

博客來

XML query processing and optimization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	XML query processing and optimization./
作者:	Zhang, Hui.
面頁冊數:	177 p.
附註:	Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3919.
Contained By:	Dissertation Abstracts International64-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ83032
ISBN:	0612830322

XML query processing and optimization.
Zhang, Hui.

XML query processing and optimization. - 177 p.

Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3919.

Thesis (Ph.D.)--University of Waterloo (Canada), 2003.

As XML becomes more widespread as a standard representation for data, XML-based query languages and their evaluations are increasingly important. For this purpose, several XML based query languages have been proposed, including W3C's XQuery. However, query processors for XML data have only recently begun to be developed, with little work on query optimizations. Certainly, there are many alternative ways to process and optimize XML queries. In common with other researchers, we wish to capitalize on the extensive work invested in relational database technology. In particular, we take an algebraic approach with the expectation that it fits in the traditional relational framework for query processing and query optimization.

ISBN: 0612830322Subjects--Topical Terms:

626642
Computer Science.

XML query processing and optimization.
LDR:03404nmm 2200313 4500 001 1857326
005 20040809115648.5
008 130614s2003 eng d
020 $a 0612830322
035 $a (UnM)AAINQ83032
035 $a AAINQ83032
040 $a UnM $c UnM
100 1 $a Zhang, Hui. $3 1019075
245 1 0 $a XML query processing and optimization.
300 $a 177 p.
500 $a Source: Dissertation Abstracts International, Volume: 64-08, Section: B, page: 3919.
500 $a Adviser: Frank Tompa.
502 $a Thesis (Ph.D.)--University of Waterloo (Canada), 2003.
520 $a As XML becomes more widespread as a standard representation for data, XML-based query languages and their evaluations are increasingly important. For this purpose, several XML based query languages have been proposed, including W3C's XQuery. However, query processors for XML data have only recently begun to be developed, with little work on query optimizations. Certainly, there are many alternative ways to process and optimize XML queries. In common with other researchers, we wish to capitalize on the extensive work invested in relational database technology. In particular, we take an algebraic approach with the expectation that it fits in the traditional relational framework for query processing and query optimization.
520 $a In this thesis, we define a query canonical form which provides a conceptually uniform vision of path expressions, element constructors and FLWR expressions in XQuery. The power of this canonical form is shown by identifying an important subset of XQuery that can be translated to this canonical form. Moreover, this canonical form nicely separates different aspects of an XML query, i.e., structure, navigation, and condition. This property makes it easy to be extended, and a possible extension of the canonical form is presented.
520 $a Having this canonical form, we present an algorithm to translate from it into an extended relational algebra that includes operators defined for the structured text datatype, and we prove its correctness. This algorithm can be used as the basis of a sound translation from XQuery to SQL, and the starting point for query optimization, which is required for XML to be supported by relational database technology.
520 $a Given an algebraic expression tree resulting from the translation algorithm, we address the query rewriting problems in the face of new operators. In addition to reusing and adapting relational optimization technologies, we develop query rewriting techniques that utilize structural information and develop a new set of algebraic rewriting rules. We demonstrate the potential optimization gained by applying these techniques.
520 $a Finally, we study how to query relational storage wrapped with XML views in our query processing and optimization framework, with a focus on how to rewrite an XQuery expression posed on XML views to an equivalent SQL query that is formulated against relational storage directly. This is achieved by utilizing characteristics of relational storage and the independence of relational algebra and physical algebra.
590 $a School code: 1141.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Waterloo (Canada). $3 1017669
773 0 $t Dissertation Abstracts International $g 64-08B.
790 1 0 $a Tompa, Frank, $e advisor
790 $a 1141
791 $a Ph.D.
792 $a 2003
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NQ83032