Constraints-Preserving Transformation from XML Document Type Definition to Relational Schema
Constraints-Preserving Transformation from XML Document Type Definition to Relational Schema
复制标题
DOI：
10.1007/3-540-45393-8_24
复制
发表时间：
2000-10
期刊：
影响因子：
--
通讯作者：
Dongwon Lee;W. Chu
中科院分区：
文献类型：
--
作者：
Dongwon Lee;W. Chu
随着可扩展标记语言（Extensible Markup Language， XML）[5]作为internet时代的数据格式的兴起，对XML数据的高效存储和查询的需求日益增加。实现这一目标的一种方法是通过将XML数据转换为关系格式来使用关系数据库。在本文中，我们认为现有的转换算法是不完整的，因为它们只关注结构方面而忽略了语义方面。我们提供了在转换过程中需要捕获的语义知识，以确保正确的关系模式。此外，我们还展示了一个简单的算法，它可以1)从给定的XML文档类型定义（DTD）中派生出这种语义知识，2)通过用关系数据库术语中的语义约束表示这些知识来保存这些知识。通过结合现有的转换算法和我们的约束保留算法，可以将XML DTD转换为关系模式，在关系模式中，保留的约束保证了正确的语义和行为。并给出了实验结果。
As Extensible Markup Language (XML) [5] is emerging as the data format of the internet era, there are increasing needs to efficiently store and query XML data. One way towards this goal is using relational database by transforming XML data into relational format. In this paper, we argue that existing transformation algorithms are not complete in the sense that they focus only on structural aspects and ignoring semantic aspects. We present the semantic knowledge that needs to be captured during the transformation to ensure a correct relational schema. Further, we show a simple algorithm that can 1) derive such semantic knowledge from the given XML Document Type Definition (DTD) and 2) preserve the knowledge by representing them in terms of semantic constraints in relational database terms. By combining the existing transformation algorithms and our constraints-preserving algorithm, one can transform XML DTD to relational schema where correct semantics and behaviors are guaranteed by the preserved constraints. Experimental results are also presented.