Mapping DTDs to relational schemas with semantic constraints

  • Authors:

  • Teng Lv;Ping Yan

  • Affiliations:

  • College of Mathematics and System Science, Xinjiang University, Urumqi 830046, People's Republic of China and Teaching and Research Section of Computer Science, Artillery Academy, Hefei 230031, Pe ...;College of Mathematics and System Science, Xinjiang University, Urumqi 830046, People's Republic of China

  • Venue:
  • Information and Software Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

XML is becoming a prevalent format and standard for data exchange in many applications. With the increase of XML data, there is an urgent need to research some efficient methods to store and manage XML data. As relational databases are the primary choices for this purpose considering their data management power, it is necessary to research the problem of mapping XML schemas to relational schemas. The semantics of XML schemas are crucial to design, query, and store XML documents and functional dependencies are very important representations of semantic information of XML schemas. As DTDs are one of the most frequently used schemas for XML documents in these days, we will use DTDs as schemas of XML documents here. This paper proposes the concept and the formal definition of XML functional dependencies over DTDs. A method to map XML DTDs to relational schemas with constraints such as functional dependencies, domain constraints, choice constraints, reference constraints, and cardinality constraints over DTDs is given, which can preserve the structures of DTDs as well as the semantics implied by the above constraints over DTDs. The concepts and method of mapping DTDs to relational schemas presented in the paper can be extended to the field of XML Schema just with some modifications in related formal definitions.