Propagating Functional Dependencies from Relational Schema to XML Schema Using Path Mapping Rules

摘要

We propose a novel technique for efficiently propagating functional dependencies from relational schema to XML schema. We present a polynomial-time algorithm FDP that can generate the XML schema according to the structures and semantics of the original relational schema and propagate the functional dependencies to the XML schema. We validate the efficiency of the technique in two ways. First we prove the soundness and complexity of the FDP algorithm. Then we implement it in our COMMIX system and present the results of a set of experiments, conducted for different databases and sets of functional dependencies. The experiments results generated from the real data reveal that the algorithm works well in practice.