Propagating XML constraints to relations

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 de...

Full description

Saved in:
Bibliographic Details
Published in2003 19th International Conference on Data Engineering pp. 543 - 554
Main Authors Davidson, S., Fan, W., Hara, C., Qin, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Data engineering
Data mining
Documentation
Engineering profession
Proposals
Relational databases
XML
Online AccessGet full text
ISBN9780780376656
078037665X
DOI10.1109/ICDE.2003.1260820

Cover

More Information
Summary: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.
ISBN:9780780376656
078037665X
DOI:10.1109/ICDE.2003.1260820