MAXDOR: Mapping XML Document into Relational Database

2009 ◽  
Vol 3 (2) ◽  
pp. 108-122 ◽  
Author(s):  
Ibrahim Dweib ◽  
Ayman Awadi ◽  
Joan Lu
Author(s):  
Abad Shah ◽  
Jacob Adeniyi ◽  
Tariq Al Tuwairqi

The Web and XML have influenced all walks of lives of those who transact business over the Internet. People like to do their transactions from their homes to save time and money. For example, customers like to pay their utility bills and other banking transactions from their homes through the Internet. Most companies, including banks, maintain their records using relational database technology. But the traditional relational database technology is unable to provide all these new facilities to the customers. To make the traditional relational database technology cope with the Web and XML technologies, we need a transformation between the XML technology and the relational database technology as middleware. In this chapter, we present a new and simpler algorithm for this purpose. This algorithm transforms a schema of a XML document into a relational database schema, taking into consideration the requirement of relational database technology.


Author(s):  
Joseph Fong ◽  
Herbert Shiu

Extensible Markup Language (XML) has become a standard for persistent storage and data interchange via the Internet due to its openness, self-descriptiveness and flexibility. This chapter proposes a systematic approach to reverse engineer arbitrary XML documents to their conceptual schema – Extended DTD Graphs ? which is a DTD Graph with data semantics. The proposed approach not only determines the structure of the XML document, but also derives candidate data semantics from the XML element instances by treating each XML element instance as a record in a table of a relational database. One application of the determined data semantics is to verify the linkages among elements. Implicit and explicit referential linkages are among XML elements modeled by the parent-children structure and ID/IDREF(S) respectively. As a result, an arbitrary XML document can be reverse engineered into its conceptual schema in an Extended DTD Graph format.


Author(s):  
Ibrahim Dweib ◽  
Joan Lu

In this chapter, the authors give a description of the experiment setup consisting of experiment environment and performance measurement. They perform experiments on mapping XML document into relational database, building XML document from relational database, updating XML document stored in relational database, and retrieving document content from relational database using XPath expressions. These experiments will be done to check the scalability and effectiveness of the model. Then they compare their model with the (Tatarinov et al., 2002) and the Accelerating XPath model (Torsten et al., 2004). The comparison consist of four stages: mapping, building, updating, and retrieving, as most of other studies just took one or two stage and forgot the others. Some of them took retrieving, others took updating, and others took updating and retrieving, but most of them did not consider mapping and rebuilding.


2012 ◽  
Vol 241-244 ◽  
pp. 2732-2736
Author(s):  
Shu Qin Huang

A new algorithm and a mapping scheme between XML document and relational database were presented. The scheme extracted name, type, value and other information from XML document, and then mapped them to relational database. Data from relational database can be restored to XML document. This method avoids information loss in the data transfer process and remains the structural relation between elements. And this mapping scheme does not depend on XML DTD or Schema.


Extensible Markup Language (XML) technology is widely used for data exchange and data representation in both online and offline mode. This structured format language able to be transformed into other formats and share information across platforms. XML is simple; however, it is designed to accommodate changes. For this paper, a study on transformation of XML document into relational database is conducted. Crucial part of this process is how to maintain the hierarchy and relationships between data in the document into database. Approaches that are discussed in this paper each uses own unique way of data storing technique and database design. Therefore, each algorithm is assessed with three datasets constitute of small, medium and large size XML file. The efficiency of the algorithms is being tested on time taken for data storing and query execution process. At the end of the evaluation, we discuss factors that affect algorithm performance and present suggestions to improve mapping scheme for future works


Author(s):  
Ibrahim Dweib ◽  
Joan Lu

This chapter gives a full description of the proposed model introduced by the authors. The new model is called MAXDOR for mapping XML document into relational database. The description includes mathematical concepts that are used in this model, the labelling method used to label XML document and identify its content, and the design framework used to maintain the document structure, parent-child, ancestor-descendant, and siblings relations among document contents. It also presents a set of algorithms for mapping, reconstructing, updating, and retrieving XML documents


2009 ◽  
pp. 1313-1333
Author(s):  
Herbert Shiu ◽  
Joseph Fong

The extensible markup language (XML) has become a standard for persistent storage and data interchange via the Internet due to its openness, self-descriptiveness, and flexibility. This article proposes a systematic approach to reverse engineer arbitrary XML documents to their conceptual schema, extended DTD graphs, which are DTD graphs with data semantics. The proposed approach not only determines the structure of the XML document, but also derives candidate data semantics from the XML element instances by treating each XML element instance as a record in a table of a relational database. One application of the determined data semantics is to verify the linkages among elements. Implicit and explicit referential linkages are among XML elements modeled by the parent-children structure and ID/IDREF(S), respectively. As a result, an arbitrary XML document can be reverse engineered into its conceptual schema in an extended DTD graph format.


2009 ◽  
pp. 2489-2509 ◽  
Author(s):  
Herbert Shiu ◽  
Joseph Fong

The extensible markup language (XML) has become a standard for persistent storage and data interchange via the Internet due to its openness, self-descriptiveness, and flexibility. This article proposes a systematic approach to reverse engineer arbitrary XML documents to their conceptual schema, extended DTD graphs, which are DTD graphs with data semantics. The proposed approach not only determines the structure of the XML document, but also derives candidate data semantics from the XML element instances by treating each XML element instance as a record in a table of a relational database. One application of the determined data semantics is to verify the linkages among elements. Implicit and explicit referential linkages are among XML elements modeled by the parent-children structure and ID/IDREF(S), respectively. As a result, an arbitrary XML document can be reverse engineered into its conceptual schema in an extended DTD graph format.


Sign in / Sign up

Export Citation Format

Share Document