Departmental Papers (CIS)
Date of this Version
March 2003
Document Type
Conference Paper
Recommended Citation
Susan B. Davidson, Wenfei Fan, Carmem Hara, and Jing Qin, "Propagating XML Constraints to Relations", . March 2003.
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.
Date Posted: 07 May 2005
Comments
Copyright 2003 IEEE. Reprinted from Proceedings of the 19th International Conference on Data Engineering 2003 (ICDE 2003), pages 543-554.
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.