Edinburgh Research Explorer

Propagating XML constraints to relations

Research output: Contribution to journalArticle

Related Edinburgh Organisations

Documents

http://dx.doi.org/10.1016/j.jcss.2006.10.022
Original languageEnglish
Pages (from-to)316-361
Number of pages46
JournalJournal of Computer and System Sciences
Volume73
Issue number3
DOIs
Publication statusPublished - 2007

Abstract

We present a technique for refining the design of relational storage for XML data. The technique is based on XML key propagation: given a set of keys on XML data and a mapping (transformation) from the XML data to relations, what functional dependencies must hold on the relations produced by the mapping? With the functional dependencies one can then convert the relational design into, e.g. 3NF, BCNF, and thus develop efficient relational storage for XML data. We provide several algorithms for computing XML key propagation. One algorithm is to check whether a functional dependency is propagated from a set of XML keys via a predefined mapping; this allows one to determine whether or not the relational design is in a normal form. The others are to compute a minimum cover for all functional dependencies that are propagated from a set of XML keys and hold on a universal relation; these provide guidance for how to design a relational schema for storing XML data. These algorithms show that XML key propagation and its associated minimum cover can be computed in polynomial time. Our experimental results verify that these algorithms are efficient in practice. We also investigate the complexity of propagating other XML constraints to relations. The ability to compute XML key propagation is a first step toward establishing a connection between XML data and its relational representation at the semantic level.

Download statistics

No data available

ID: 17663966