mapping XML DTD to relational schema

XML has emerged as a standard for data exchange over the internet.Relational databases provides a mature technology to store these documents. In this paper we transform ER diagram of relational databases in to DTD of XML documents. We provide an algorithm that translates ER diagram with cycles

against a view schema drawn form a relational database, aiming at evaluating the similarity between the view schema and the DTDs for (semi)automatic translation of relational tables (i.e., views, queries) data into XML documents. The paper discusses a matching algorithm and evaluates the similarity

Abstract. Domain-specific documents often share an inherent, though undocumented structure. This structure should be made explicit to facilitate efficient, structure-based search in archives as well as information integration. Inferring a semantically structured XML DTD for an archive

concise XML DTD (Document Type Declaration) for the phone book. Table of Contents

Document Type Definition (DTD) is very important because it contains a set of rules that specifies and captures the structure of XML (eXtensible Markup Language) document. Most of the current approaches for generating DTD from relational views do not support nested elements for DTD. Furthermore

as structured annotations according to valid XML documents. 1.

We study the inference of Data Type Definitions (DTDs) for views of XML data, using an abstraction that focuses on document content structure. The views are defined by a query language that produces a list of documents selected from one or more input sources. The selection conditions involve

. In Multidimensional XML, elements and attributes may depend on a number of dimensions, that define worlds under which variants of those elements or attributes hold. Moreover, we propose an extension of DTD that takes dimensions into account and is suitable for describing the logical structure of MXML documents. We

The volume of XML data exchange is explosively increasing, and the need for efficient mechanisms of XML data management is vital. Many XML storage models have been proposed for storing XML DTD-independent documents in relational database systems. Benchmarking is the best way to highlight pros