A Narrative Review of Storing and Querying XML Documents Using Relational Database

2019 ◽  
Vol 18 (04) ◽  
pp. 1950048
Author(s):  
Amjad Qtaish ◽  
Mohammad T. Alshammari
Keyword(s):  
Relational Database ◽  
File Systems ◽  
Data Representation ◽  
Xml Data ◽  
Xml Documents ◽  
Data Interchange ◽  
Extensible Markup ◽  
Data Environment ◽  
Object Oriented Database ◽  
The Web

Extensible Markup Language (XML) has become a common language for data interchange and data representation in the Web. The evolution of the big data environment and the large volume of data which is being represented by XML on the Web increase the challenges in effectively managing such data in terms of storing and querying. Numerous solutions have been introduced to store and query XML data, including the file systems, Object-Oriented Database (OODB), Native XML Database (NXD), and Relational Database (RDB). Previous research attempts indicate that RDB is the most powerful technology for managing XML data to date. Because of the structure variations of XML and RDB, the need to map XML data to an RDB scheme is increased. This growth has prompted numerous researchers and database vendors to propose different approaches to map XML documents to an RDB, translating different types of XPath queries to SQL queries and returning the results to an XML format. This paper aims to comprehensively review most cited and latest mapping approaches and database vendors that use RDB solution to store and query XML documents, in a narrative manner. The advantages and the drawbacks of each approach is discussed, particularly in terms of storing and querying. The paper also provides some insight into managing XML documents using RDB solution in terms of storing and querying and contributes to the XML community.

Abstract DTD Graph from an XML Document

2010 ◽  
pp. 204-224
Author(s):  
Joseph Fong ◽  
Herbert Shiu
Keyword(s):  
Relational Database ◽  
The Internet ◽  
Conceptual Schema ◽  
Reverse Engineer ◽  
Xml Documents ◽  
Data Interchange ◽  
Data Semantics ◽  
Xml Document ◽  
Extensible Markup ◽  
Implicit And Explicit

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.

Reverse Engineering from an XML Document into an Extended DTD Graph

2009 ◽  
pp. 1313-1333
Author(s):  
Herbert Shiu ◽  
Joseph Fong
Keyword(s):  
Relational Database ◽  
The Internet ◽  
Conceptual Schema ◽  
Reverse Engineer ◽  
Xml Documents ◽  
Data Interchange ◽  
Data Semantics ◽  
Xml Document ◽  
Extensible Markup ◽  
Implicit And Explicit

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.

Reverse Engineering from an XML Document into an Extended DTD Graph

2009 ◽  
pp. 2489-2509 ◽  
Author(s):  
Herbert Shiu ◽  
Joseph Fong
Keyword(s):  
Relational Database ◽  
The Internet ◽  
Conceptual Schema ◽  
Reverse Engineer ◽  
Xml Documents ◽  
Data Interchange ◽  
Data Semantics ◽  
Xml Document ◽  
Extensible Markup ◽  
Implicit And Explicit

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.

XRecursive

2013 ◽  
pp. 281-292
Author(s):  
Mohammed Adam Ibrahim Fakharaldien ◽  
Jasni Mohamed Zain ◽  
Norrozila Sulaiman ◽  
Tutut Herawan
Keyword(s):  
General Solution ◽  
Relational Database ◽  
Relational Databases ◽  
Xml Schema ◽  
Xml Data ◽  
Xml Documents ◽  
Extra Effort ◽  
Extensible Markup ◽  
Promising Solution ◽  
Reconstruction Time

Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well. 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. This paper proposes an alternative method named Xrecursive for mapping XML (eXtensible Markup Language) documents to RDB (Relational Databases). The Xrecursive method does not need a DTD (Document Text Definition) or XML schema. Further, it can be applied as a general solution for any XML data. The steps and algorithm of Xrecursive are given in details to describe how to use the storing structure to storage and query XML documents in relational database. The authors report their experimental results on a real database, showing that the performance of their Xrecursive algorithm achieves better results in terms of storage size, insertion time, mapping time, and reconstruction time as compared with that SUCXENT and XParent methods. In overall, Xrecursive performs better in term of query performances as compared to the both methods.

XRecursive

2011 ◽  
Vol 1 (4) ◽  
pp. 53-65 ◽  
Author(s):  
Mohammed Adam Ibrahim Fakharaldien ◽  
Jasni Mohamed Zain ◽  
Norrozila Sulaiman ◽  
Tutut Herawan
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Structured Data ◽  
Markup Language ◽  
Xml Data ◽  
Xml Documents ◽  
Extra Effort ◽  
Extensible Markup ◽  
Promising Solution ◽  
Reconstruction Time

Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well. 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. This paper proposes an alternative method named Xrecursive for mapping XML (eXtensible Markup Language) documents to RDB (Relational Databases). The Xrecursive method does not need a DTD (Document Text Definition) or XML schema. Further, it can be applied as a general solution for any XML data. The steps and algorithm of Xrecursive are given in details to describe how to use the storing structure to storage and query XML documents in relational database. The authors report their experimental results on a real database, showing that the performance of their Xrecursive algorithm achieves better results in terms of storage size, insertion time, mapping time, and reconstruction time as compared with that SUCXENT and XParent methods. In overall, Xrecursive performs better in term of query performances as compared to the both methods.

Reverse Engineering from an XML Document into an Extended DTD Graph

2011 ◽  
pp. 101-119
Author(s):  
Herbert Shiu ◽  
Joseph Fong
Keyword(s):  
Relational Database ◽  
The Internet ◽  
Conceptual Schema ◽  
Reverse Engineer ◽  
Xml Documents ◽  
Data Interchange ◽  
Data Semantics ◽  
Xml Document ◽  
Extensible Markup ◽  
Implicit And Explicit

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 paper 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.

Technique for Transformation of Data From RDB to XML Then to RDF

2017 ◽  
pp. 70-91 ◽  
Author(s):  
Kaleem Razzaq Malik ◽  
Tauqir Ahmad
Keyword(s):  
Semantic Web ◽  
Relational Database ◽  
Resource Description Framework ◽  
Data Science ◽  
True Nature ◽  
Extensible Markup ◽  
Description Framework ◽  
Mapping Techniques ◽  
Resource Description ◽  
The Web

This chapter will clearly show the need for better mapping techniques for Relational Database (RDB) all the way to Resource Description Framework (RDF). This includes coverage of each data model limitations and benefits for getting better results. Here, each form of data being transform has its own importance in the field of data science. As RDB is well known back end storage for information used to many kinds of applications; especially the web, desktop, remote, embedded, and network-based applications. Whereas, EXtensible Markup Language (XML) in the well-known standard for data for transferring among all computer related resources regardless of their type, shape, place, capability and capacity due to its form is in application understandable form. Finally, semantically enriched and simple of available in Semantic Web is RDF. This comes handy when with the use of linked data to get intelligent inference better and efficient. Multiple Algorithms are built to support this system experiments and proving its true nature of the study.

Web Retrieval of XML Documents

2011 ◽  
pp. 170-199
Author(s):  
Barbara Catania ◽  
Elena Ferrari
Keyword(s):  
Expressive Power ◽  
Data Representation ◽  
Query Languages ◽  
Heterogeneous Data ◽  
Data Sources ◽  
Xml Data ◽  
Web Documents ◽  
Web Retrieval ◽  
Heterogeneous Data Sources ◽  
The Web

Web is characterized by a huge amount of very heterogeneous data sources, that differ both in media support and format representation. In this scenario, there is the need of an integrating approach for querying heterogeneous Web documents. To this purpose, XML can play an important role since it is becoming a standard for data representation and exchange over the Web. Due to its flexibility, XML is currently being used as an interface language over the Web, by which (part of) document sources are represented and exported. Under this assumption, the problem of querying heterogeneous sources can be reduced to the problem of querying XML data sources. In this chapter, we first survey the most relevant query languages for XML data proposed both by the scientific community and by standardization committees, e.g., W3C, mainly focusing on their expressive power. Then, we investigate how typical Information Retrieval concepts, such as ranking, similarity-based search, and profile-based search, can be applied to XML query languages. Commercial products based on the considered approaches are then briefly surveyed. Finally, we conclude the chapter by providing an overview of the most promising research trends in the fields.

An Algorithm for Transforming XML Documents Schema into Relational Database Schema

2011 ◽  
pp. 171-189 ◽  
Author(s):  
Abad Shah ◽  
Jacob Adeniyi ◽  
Tariq Al Tuwairqi
Keyword(s):  
Relational Database ◽  
Database Schema ◽  
The Internet ◽  
Xml Documents ◽  
Simpler Algorithm ◽  
Xml Document ◽  
Database Technology ◽  
Relational Database Schema ◽  
Xml Technologies ◽  
The Web

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.

Storage and Access Control Policies for XML Documents

2005 ◽  
pp. 2616-2621
Author(s):  
George Pallis ◽  
Konstantina Stoupa ◽  
Athena Vakali
Keyword(s):  
Access Control ◽  
Knowledge Exchange ◽  
File Systems ◽  
Data Representation ◽  
The Internet ◽  
Xml Documents ◽  
Web Document ◽  
Web Information System ◽  
Access Control Policies ◽  
Control Modules

The Internet (and networks overall) are currently the core media for data and knowledge exchange. XML is currently the most popular standardization for Web document representation and is rapidly becoming a standard for data representation and exchange over the Internet. One of the main issues is XML documents and in particular, storage and accessing. Among data management issues, storage and security techniques have a particular importance, since the performance of the overall XML-based Web information system relies on them. Storage issues mainly rely on the usage of typical database management systems (DBMSs), whereas XML documents can also be stored in other storage environments (such as file systems and LDAP directories) (Amer-Yahia & Fernandez, 2002; Kanne & Moerkotte, 2000; Silberschatz, Korth & Sudarshan, 2002). Additionally, in order to guarantee the security of the XML data, which are located in a variety of the above storage topologies, the majority of implementations also provide an appropriate access control. Most storage systems cooperate with access control modules implementing various models (Joshi, Aref, Ghafoor & Spafford, 2001), whereas there are few commercial access control products available. However, there are some standardized XML-based access control languages that can be adopted by most tools.

Sign in / Sign up

Export Citation Format

Share Document