DocumentCode :
2507238
Title :
Propagating XML constraints to relations
Author :
Davidson, Susan ; Fan, Wenfei ; Hara, Carmem ; Qin, Jing
Author_Institution :
Pennsylvania Univ., Philadelphia, PA, USA
fYear :
2003
fDate :
5-8 March 2003
Firstpage :
543
Lastpage :
554
Abstract :
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given functional dependency is propagated from XML keys via a predefined view; the others compute a minimum cover for all functional dependencies on a universal relation given XML keys. Experimental results show that these algorithms are efficient in practice. We also investigate the complexity of propagating other XML constraints to relations, and the effect of increasing the power of the transformation language. Computing XML key propagation is a first step toward establishing a connection between XML data and its relational representation at the semantic level.
Keywords :
XML; data handling; relational databases; tree data structures; XML constraint; XML data; XML key propagation; functional dependency; relational storage; semantic level; transformation language; Books; Data engineering; Data mining; Documentation; Engineering profession; Proposals; Relational databases; 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.1260820
Filename :
1260820
Link To Document :
بازگشت