DocumentCode
2507696
Title
XML publishing: look at siblings too!
Author
Amer-Yahia, Sihem ; Kotidis, Yannis ; Srivastava, Divesh
Author_Institution
AT&T Labs, USA
fYear
2003
fDate
5-8 March 2003
Firstpage
711
Lastpage
713
Abstract
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be evaluated and their results shipped to the client. We illustrate novel optimization techniques that enable computation sharing between queries that construct sibling elements in the XML tree. Such queries typically share large common join expressions that can be exploited through appropriate rewritings. These rewritings are fundamental to XML publishing and provide considerable performance benefits without having to modify the relational engine.
Keywords
SQL; XML; query processing; relational databases; rewriting systems; tree data structures; SQL queries; XML document; XML publishing; XML tree; nested XML document; optimization; relational databases; relational engine; rewritings; sibling elements; Costs; Data engineering; Engines; Information retrieval; Merging; Publishing; Tagging; Tree data structures; XML;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 2003. Proceedings. 19th International Conference on
Print_ISBN
0-7803-7665-X
Type
conf
DOI
10.1109/ICDE.2003.1260844
Filename
1260844
Link To Document