Schema Based Storage of Xml Documents in Relational Databases

onlinepresent.org

Mapping XML documents into relational database is a promising solution because relational databases are mature and scale very well and they have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort. In this paper, we propose two algorithms (XRD, XRS) that maps XML documents into relational database. The algorithm steps are given in details to describe how to map the XML documents into relational database. Then we report our experimental results on a real database to show the performance of our method in some features.

International Association for Development of the Information Society, 2004

Since XML becomes a crucial format for representing information, it is necessary to establish techniques for managing XML documents. A possible solution can be found in storing XML data in (object-)relational databases. For this purpose most of the existing techniques often exploit an XML schema of the stored XML data, usually expressed in DTD. But the more complex today's applications

International Journal of Web Engineering and Technology, 2004

With the increasing amount of XML used in web applications for representing and exchanging information, researchers have proposed different methods of using relational database to store and manage XML data. The model-mapping methods do not require DTD so that fixed database schemas can be used. In this paper, we present a new model-mapping method called INode*. This method is based on a numbering scheme for mapping XML data into relational databases. It enables quick retrieval of ancestor-descendant relationships between elements in XML by simple calculations. Experiments show that INode* can reduce the storage requirement while having a better query performance in comparison to several other model-mapping methods.

Int'l Workshop on the Web and …, 2001

2001

XML is increasingly being adopted for information publishing on the World Wide Web. However, the underlying data is often stored in the relational databases. Some mechanism is needed to convert the relational data into XML data. In this work, we employ a semantically rich semistructured data model, the Object-Relationship-Attribute model for semistructured data, as a middleware to support the schema conversion from semantically enriched relational schema to XML Schema. This approach allows us to handle the translation of a set of related relations and to distinguish attributes of relationship types from attributes of object classes, multivalued attributes, and different types of relationships such as binary, n-ary, recursive and ISA. The resulting XML structures are able to reflect the inherent semantics and implicit structure in the underlying relational database. We also show that the appropriate use of references is able to avoid unnecessary redundancy and the proliferation of disconnected XML elements.

Now a day's, XML files are most vital facet of code trade. As a core normal, XML provides a solid foundation around that different standards could grow. Making DTD's is possibly what the creators of XML had in mind after they known as it ex-tensile terminology. XML may be a file extension for XML file format accustomed produce common info formats and share each the format and also the information on the globe Wide internet, intranets, et al. victimization normal code text. XML provides regular thanks to describe semi-structured information. We tend to propose the propose methodology uses stemming stopping process in conjunction with tree structure. Performing stemming, stopping and parsing on that file, as per the tag file makes columns in relational database and insert tag information in the respective columns, all files saves in one folder. These embody consistency problems for mappings and schema, additionally as imposing tighter restrictions on mappings and queries to attain tractable question responsive in information exchange. The propose method can achieve better performance in decreasing of time and space complexities.

Knowledge-Based Systems, 2011

a b s t r a c t XML has recently emerged as the leading medium for data storage and data transfer over the World Wide Web due to its adaptable structure and flexibility in defining the tags. Many organizations had adopted XML as the principal facet in their online business applications. On the other hand, relational database is still widely used as the back-end database in most organizations. The diversity of these models need to be taken into account to ensure transparent and seamless integration. In this paper, we propose s-XML, an effective mapping scheme to bridge XML and relational database. Experimental results indicate that (1) s-XML is robust in terms of database storage and data loading; (2) s-XML processes query efficiently for complex chain and twig queries; and (3) s-XML is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.

The eXtensible Markup Language (XML) has recently emerged as a standard for data representation and interchange on the web. Based on its popularity used in most application, the critical issues are to store and to query XML data to exploit the full power of this technology. Since relational database is widely used technology for storing and querying, therefore replacing it with pure XML database is not a good choice and very expensive process. It is thus crucial to map XML data into relational data and this process is one that occurs frequently. Many existing methods exist in the literature, and defining what the best mapping method is explicitly important. The intention of this paper is to the existing mapping methods in terms of generating good relational schema. At the end a new mapping method is developed to overcome the limitations the limitations and shows that it is efficient in terms of removing relation redundancy.

… Computer Theory and …, 2010

a b s t r a c t XML has recently emerged as the leading medium for data storage and data transfer over the World Wide Web due to its adaptable structure and flexibility in defining the tags. Many organizations had adopted XML as the principal facet in their online business applications. On the other hand, relational database is still widely used as the back-end database in most organizations. The diversity of these models need to be taken into account to ensure transparent and seamless integration. In this paper, we propose s-XML, an effective mapping scheme to bridge XML and relational database. Experimental results indicate that (1) s-XML is robust in terms of database storage and data loading; (2) s-XML processes query efficiently for complex chain and twig queries; and (3) s-XML is able to support large and skew-structured dataset as compared to relational DTD, Attribute and Edge approaches.

Lecture Notes in Computer Science, 2009

We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constraints are preserved, no redundance is introduced, different hierarchical views of the conceptual information are available, the resulting XML structure is highly connected, and the design is reversible. We investigate two different ways to nest the XML structure: a maximum connectivity nesting, that minimizes the number of schema constraints used in the mapping of the conceptual schema reducing the validation overhead, and a maximum depth nesting, that keeps low the number of (expensive) join operations that are necessary to reconstruct the information at query time using the mapped schema. We propose a graph-theoretic linear-time algorithm to find a maximum connectivity nesting and show that finding a maximum depth nesting is NP-complete. We complement our investigation with an implementation of the devised translation and we embed the implemented module in a software framework for the conceptual and logical design of spatio-temporal databases 1 .