Academia.eduAcademia.edu

Outline

Title
Abstract
Figures
Introduction
Related Work
References
All Topics
Computer Science
Algorithms and Data Structures

Mapping of XML Document and Relational Database (Using Structural Queries

Profile image of GRD JOURNALSGRD JOURNALS
visibility

…

description

3 pages

Abstract

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.

Figures (2)
Table 1: Merits and Demerits of the Recent Proposed system IV. PROPOSED SYSTEM evaluation is made and the baseline data is expanded to enhance the authenticity and efficiency of the experiment. Relational databases specialize in relating individual data records grouped by type in tables [2]. Developers can join records together as needed using SQL and present one or more records to end-users as meaningful information. The approach proposed supports efficiently the structural modifications to the X ML tree, and achieves lower storage consumption [3]. Also, proposed two powerful algorithms for mapping X ML data to relational databases and from relational database to X ML data. Te bela 4 ys Dette ond Niiwwarthoon€ tho Barnont Deoanmcad ocoelany
Table 1: Merits and Demerits of the Recent Proposed system IV. PROPOSED SYSTEM evaluation is made and the baseline data is expanded to enhance the authenticity and efficiency of the experiment. Relational databases specialize in relating individual data records grouped by type in tables [2]. Developers can join records together as needed using SQL and present one or more records to end-users as meaningful information. The approach proposed supports efficiently the structural modifications to the X ML tree, and achieves lower storage consumption [3]. Also, proposed two powerful algorithms for mapping X ML data to relational databases and from relational database to X ML data. Te bela 4 ys Dette ond Niiwwarthoon€ tho Barnont Deoanmcad ocoelany
As shown in fig.1, the application involves the web application. The application involves the admin panel and user panel. Bot! having login and registration access. First step of useris, to register itself on application then access the application. The applicatio1 involves the process of converting the XML documents into Relational Database. The system first collect the XML document: from user, then store in the system. After storing the document system creates the X ML folder of specific document which we want to convert and parse the X ML document. Fig. 1: Architecture of proposed system
As shown in fig.1, the application involves the web application. The application involves the admin panel and user panel. Bot! having login and registration access. First step of useris, to register itself on application then access the application. The applicatio1 involves the process of converting the XML documents into Relational Database. The system first collect the XML document: from user, then store in the system. After storing the document system creates the X ML folder of specific document which we want to convert and parse the X ML document. Fig. 1: Architecture of proposed system

Related papers

Query Mapping Techniques for XML Documents: A Comparative Study
Amjad Qtaish

Extensible Markup Language (XML) has grown to be a promising medium for data interchange and representation over the Internet. In the presence of the database technology there is a growing need to develop efficient storage and querying large repositories of XML documents. Numerous researchers proposed various mapping approaches using Relational Database (RDB) to store and query XML documents. These approaches are categorized into two: structure-mapping and model-mapping approaches. Various query mapping techniques (Edge-based, Node-based, and Path-based) are proposed and applied on the existing model mapping approaches. These techniques translate XPath query into Structured Query Language (SQL) statement with less number of join operations and reduce the search space, and improved the XML query processing. Therefore, the aim of this paper is to compare these query mapping techniques in terms of their advantages and limitations. The implication of these query mapping techniques on the existing model mapping approaches are also discussed. The discussion is focus on the complexity of translated SQL and query response time, which affect the efficiency of the XML query processing. Finally, the effectiveness for each technique on XML query processing and the solutions are pointed out.

View PDFchevron_right
Innovative Way for Normalizing XML Document
Alexander Decker

As XML becomes widely used, dealing with redundancies in XML data has become an increasingly important issue. Redundantly stored information can lead not just to a higher data storage cost, but also to increased costs for data transfer and data manipulation, such data redundancies can lead to potential update anomalies. One way to avoid data redundancies is to employ good schema design based on known functional dependencies. This paper presents a graphical approach to model XML documents based on a Data Type Documentation called Graphical Notations-Data Type Documentation (GN-DTD).

View PDFchevron_right
MAXDOR: Mapping XML Document into Relational Database
Ibrahim M Dweib

The Open Information Systems Journal, 2009

The eXtensible Markup Language (XML) is used for representing and exchanging data through the Internet, but this technology needs a suitable medium for storing these data. At present, three common technologies can be used to store and retrieve XML documents, i.e., native XML database, Object oriented Database (OODB) and Relational Database (RDB). This paper describes a general method for mapping XML documents to relational database. The method does not need a DTD or XML schema. It uses global label approach for identifying each token in XML document. Three label are added to each token; parent labels, left sibling and right sibling; to facilitate insertion and update process and makes this cost constant, in contrast of previous approaches that need to relabelled following or descendants tokens. The method can also be used for data-centric and document-centric documents. Experiments on this method show its ability to maintain document structure at a low cost price and building of the original document is straight forward.

View PDFchevron_right
Efficient Relational Storage and Retrieval of XML Documents
Guido Moerkotte

Lecture Notes in Computer Science, 2001

Bohannon et al. claim that XML is becoming the predominant data exchange format in a variety of application domains. Altinel and Franklin hold that the advent of XML as a standard for information exchange and the development of query languages for XML data enable the development of more sophisticated filtering mechanisms that take structure information into account. Shanmugasundaram et al. develop algorithms and implement a prototype system that converts XML documents to relational tuples, translates semi-structured queries over XML documents to SQL queries over tables, and converts the results to XML. Quint and Vatton review the main innovations of XML and consider their impact on the editing techniques for structured documents. Bohannon et al. claim that XML is becoming the predominant data exchange format in a variety of application domains:

View PDFchevron_right
XML: some papers in a haystack
Carina Friedrich Dorneles

Sigmod Record, 2009

XML has been explored by both research and industry com- munities. More than 5500 papers were published on different aspects of XML. With so many publications, it is hard for someone to decide where to start. Hence, this paper presents some of the research topics on XML, namely: XML on re- lational databases, query processing, views, data matching, and schema

View PDFchevron_right
INode*: an effective approach for storing XML using relational database
Vincent Ng

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.

View PDFchevron_right
Generating the Good XML Schema from Relational Database by using String Matching Algorithms
Myint Myint Lwin

Tenth International Conference On Computer Applications (ICCA 2012), 2012

Data exchanging is involving as an important role in the Web application and Extensible Markup Language (XML) is also accepted as the standard for exchanging information between the heterogeneous systems. The XML schema acts as the standard format between the sender and receiver for the XML documents. As a result, the design of the schema document is very important because most of the XML documents are validated with their schema. In this paper, the two string matching algorithms (Maximum Consecutive Substring at right and any) are proposed for detecting the common attributes in the relations. Then, these string matching algorithms are applied for detecting the common attributes in the relations. The similar attributes are grouped and converted as element group in XML schema document for converting the relational database to XML schema document. The resulted XML schema is more modular; more understand for the human readers and reduce the maintainability effort.

View PDFchevron_right
A methodology for indexing and retrieval of information from XML document
shoaib arshad

The XML documents having markup elements are increasing vividly on the World Wide Web. Now the exigency is that how these documents could be used for the welfare of our posterity so that indexing and retrieving of these documents can be made more accurate and precise. The endeavors to make the standards for indexing and retrieving of XML documents are burgeoning. Currently the structured documents are using elements to represent the structured documents, but if also the attributes are used to represent the structure information then the indexing retrieval process can be made more flexible and exact. We have intermingled the elements and attributes to represent XML documents and then hierarchical or tree based indexing to the XML documents is used which step-up the efficiency of the indexing and retrieval methodology for XML documents.

View PDFchevron_right
XAncestor: An Efficient Mapping Approach for Storing and Querying XML Documents in Relational Database using Path-Based Technique
Amjad Qtaish

XML has become a common language for data exchange on the Web, so it needs to be managed effectively. There are four central problems in XML data management: capture, storage, retrieval, and exchange. Even though numerous database systems are available, the relational database (RDB) is often used to store and query the content of XML documents. Therefore the processes of mapping from XML to RDB and vice versa occur frequently. Numerous researchers have proposed approaches to map hierarchically structured XML documents into the tabular format of a RDB. However, the previously developed approaches have faced problems in terms of storage and query response time. If the design of a RDB is inefficient, the number of join operations between tables increases when a query is executed, which affects the query response time. To overcome this limitation, this paper proposes a new mapping approach, known as XAncestor, which consists of two algorithms: an XML mapping algorithm (XtoDB) and a query mapping algorithm (XtoSQL). XtoDB maps XML documents to a fixed RDB with less storage space. XtoSQL translates XPath queries into corresponding SQL queries based on the constructed RDB in order to reduce the query response time i.e., the time taken to execute the translated SQL query. XAncestor is then developed as a prototype in order to test its effectiveness. The results of XAncestor are compared with those produced by five similar approaches. The comparison proves that XAncestor performs better than the previously developed approaches in terms of effectiveness and scalability. The correctness of XAncestor is also verified. The paper concludes with some recommendations for further work.

View PDFchevron_right
XML IN THE WORLD OF (OBJECT)RELATIONAL DATABASE SYSTEMS
Jaroslav Pokorny

Integrated Spatial Databases, 2000

View PDFchevron_right
GRD Journals- Global Research and Development Journal for Engineering | Volume 2 | Issue 12 | November 2017 ISSN: 2455-5703 Mapping of XML Document and Relational Database (Using Structural Queries) Pallavi Chikhale Shital Harihar Department of Computer Engineering Department of Computer Engineering SIT, Lonavala, Pune, India SIT, Lonavala, Pune, India Vandna Adhude Prof. Prashant Raut Department of Computer Engineering Department of Computer Engineering SIT, Lonavala, Pune, India SIT, Lonavala, Pune, India Abstract 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. Keywords- XML, Relational Database, Time and Space Complexity, Stemming Stopping Process, Tree Data Structure I. INTRODUCTION Today is an information era, most enterprises and individuals are deploying their businesses on the internet including e-learning, e-commerce and e-library. This will result in an exponential growth in data, which finally forming the so called BIGDATA. XML is an Extensible Markup Language that defines the set of rules for encoding document in both human and machine-readable formats. XML is widely used in web services, especially data transmission or data conversion and storing. XML data can be stored in disks or else in Relational database. A relational database is a collection of data items organized as a set of formally described tables from which data can be accessed or reassembled in many different ways without having to reorganize the database tables. The standard user and application program interface to a relational database is the structured query language (SQL). SQL statements are used both for interactive queries for information from a relational database and for gathering data for reports. Batch Stream processing can be used to fasten the process, so overall system performance in case of time and space complexity can be reduced. Batch system have an option to allow users to set task processing in automated sequence. II. RELATED WORK The objective of proposed system is to provide efficient web service that can use commercially available converting the large XML documents in Relational Database. There are many approaches proposed for XML documents and Relational Database, such as mini-XML [1], s-XML [5], XRel [4]. A recently proposed mapping approach mini-XML, which adopts the path-based technique as the basic technique among the non-leaf nodes [1]. One of the important features of XML documents is that we can perform operations based on their logical structures. XML documents manage to support queries on their logical structures and on their contents. In XRel, there are two approaches to designing database schemas for XML documents, such as Structure-mapping approach and Model-mapping approach. In the structure-mapping approach, a database schema is defined for each XML document structure. In model-mapping approach, a fixed database schema is used to store the structure of all XML documents. In XRecursive, it translate XML documents to relational database according to the proposed storing structure [2]. III. LITERATURE SURVEY An efficient approach named mini-XML [1] is proposed based on model-mapping approach. The mini-XML adopts the path-based technique as the among the non-leaf nodes. The reorganization of the XML documents tree is achieved via labelling each leaf node with a sequence number. By comparing the time and space spent mapping XML data into a relational database, an effective All rights reserved by www.grdjournals.com 47 Mapping of XML Document and Relational Database (Using Structural Queries) (GRDJE/ Volume 2 / Issue 12 / 008) evaluation is made and the baseline data is expanded to enhance the authenticity and efficiency of the experiment. Relational databases specialize in relating individual data records grouped by type in tables [2]. Developers can join records together as needed using SQL and present one or more records to end-users as meaningful information. The approach proposed supports efficiently the structural modifications to the XML tree, and achieves lower storage consumption [3]. Also, proposed two powerful algorithms for mapping XML data to relational databases and from relational database to XML data. Table 1: Merits and Demerits of the Recent Proposed system No Title Year Advantages Disadvantages Mini XML:An Used the The proposed e_cient map- semi- method can achieve ping approach structural better performance 1 between XML 2017 data but does in the decreasing and Relational not use the of storage time and Database structural storage space queries. Future to provide a XMap: A Novel The complexity of this algorithm is powerful Approach to equal to O (n), its a linear complexity, Framework Store and Re- where n is number of elements and attributes in the XML document. for XQuery to trieve XML 2 2011 Indeed in our algorithm a search is performed by SQL transla- Document traversing once the tion with all In Relational resultSet using a queries types Databases loop statement (select, in- sert, update, and delete) Xrecursive XRecursive: A has lower Storage Method performance for XML Docume-nt Based 3 2011 It can easily retrieve data from relational database. ratio as on Relational compared Database to existing techniques XRel: A Path- Based Approah an approach to storage and retrieval of XML Space Complexity and ToStorage and documents using Time complexity 4 2009 Retrieval of XML Docume-nts (object) relational required is using Relational Databases. More. Database IV. PROPOSED SYSTEM As shown in fig.1, the application involves the web application. The application involves the admin panel and user panel. Both having login and registration access. First step of user is, to register itself on application then access the application. The application involves the process of converting the XML documents into Relational Database. The system first collect the XML documents from user, then store in the system. After storing the document system creates the XML folder of specific document which we want to convert and parse the XML document. Fig. 1: Architecture of proposed system All rights reserved by www.grdjournals.com 48 Mapping of XML Document and Relational Database (Using Structural Queries) (GRDJE/ Volume 2 / Issue 12 / 008) After parse the XML document system apply the propose algorithm and SQL queries on XML documents for converting into relational database. Finally, it creates the relational database of given XML documents which store in folder of particular user. V. ADVANTAGES The proposed system web service has many quality attribute that are given below:- 1) Adaptability: This service is adaptable by all users. 2) Availability: This service is freely available to all users. The availability of the service is easy for everyone. 3) Maintainability: After the deployment of the project if any error occurs then it can be easily maintained by the software developer. 4) Reliability: The performance of the software is better which will increase the reliability of the Software. 5) User Friendliness: Since, the system is a GUI web service; the output generated is much user friendly in its behavior, So user can easily add, remove, update its documents. 6) Security: Users has its own login access, so many security phases so reliable security is provided. 7) Corrupt File: If the uploaded XML file is corrupt, then system automatically detect the corrupted file. VI. CONCLUSION XML is an Extensible Markup Language and can be used for storing and transportation of data. XML document is light weight document but it is not easily understandable by normal human being, so there is need of converting this XML document into Relational Database by using structural queries. A relational database is a collective set of multiple data sets organized by tables, records and columns. It establish a well-defined relationship between database tables. Tables communicate and share information, which facilitates data search ability, organization and reporting. It use Structured Query Language (SQL), which is a standard user application that provides an easy programming interface for database interaction. For fasten processing, there is need of proper conversion of XML to relational database. The paper concludes that the proper parsing of XML data. Batch stream processing along with tree structure can be used to fasten the process. After creating tree, attribute objects can be combined into clusters so, the time complexity of an algorithm can be reduced. VII. FUTURE SCOPE The application provides the conversion of XML documents into relational database using structural queries. The propose system takes less time and space for relational database after conversion of XML documents to Relational Database. REFERENCES [1] Huchao Zhu,Huiqun Yu(Corresponding Author), “Mini XML: An efficient mapping approach, between XML and Relational Database”,2017. [2] M.A. Ibrahim Fakharaldien, Jasni Mohamed Zain, and Norrozila Sulaiman,” XRecursive: A Storage Method for XML Document Based on Relational Database”, 2011 [3] Bousalem, Zakaria, and Ilias Cherti. "XMap: A Novel Approach to Store and Retrieve XML Document in Relational Databases." JSW 10.12 (2015): 1389- 1401. [4] Masatoshi Yoshikawa and Toshiyuki Amagasa, “XRel: A Path-Based Approach to Storage and Retrieval of XML Documents using Relational Databases”, 2009 [5] Samini Subramaniam, Su-Cheng Haw, Poo Kuan Hoong,”s-XML: An efficient mapping scheme to bridge XML and relational database” [6] Arenas M, Barcel P, Libkin L, et al. Foundations of Data Exchange[C]// Cambridge University Press, 2014. [7] Vaidya AV, Study of Optimal Indexing Schema for Xml Query Processing and Effective Storage Management 2009 to 2013, 2015 [8] Yoshikawa M, Amagasa T, Shimura T, et al. XRel: a path-based approach to storage and retrieval of XML documents using relational databases [J]. Acm Transactions on Internet Technology, 2001, 1(1):110- 141 [9] Jiang H, Lu H, Wang W, et al. Path materialization revisited: an efficient storage model for XML data[C]// Australasian Database Conference. Australian Computer Society, Inc. 2002:85-94. [10] Dweib I M. Automatic mapping of XML documents into relational database [J]. University of Hudders eld, 2010. [11] Arenas M, Barcel P, Libkin L, et al. Relational and XML Data Exchange [J]. 2010, 2(1):112. [12] Arenas M, Barcel P, Libkin L, et al. Foundations of Data Exchange[C]//Cambridge University Press, 2014. All rights reserved by www.grdjournals.com 49

References (12)

  1. Huchao Zhu,Huiqun Yu(Corresponding Author), "Mini XML: An efficient mapping approach, between XML and Relational Database",2017.
  2. M.A. Ibrahim Fakharaldien, Jasni Mohamed Zain, and Norrozila Sulaiman," XRecursive: A Storage Method for XML Document Based on Relational Database", 2011
  3. Bousalem, Zakaria, and Ilias Cherti. "XMap: A Novel Approach to Store and Retrieve XML Document in Relational Databases." JSW 10.12 (2015): 1389- 1401.
  4. Masatoshi Yoshikawa and Toshiyuki Amagasa, "XRel: A Path-Based Approach to Storage and Retrieval of XML Documents using Relational Databases", 2009
  5. Samini Subramaniam, Su-Cheng Haw, Poo Kuan Hoong,"s-XML: An efficient mapping scheme to bridge XML and relational database"
  6. Arenas M, Barcel P, Libkin L, et al. Foundations of Data Exchange[C]// Cambridge University Press, 2014.
  7. Vaidya AV, Study of Optimal Indexing Schema for Xml Query Processing and Effective Storage Management 2009 to 2013, 2015
  8. Yoshikawa M, Amagasa T, Shimura T, et al. XRel: a path-based approach to storage and retrieval of XML documents using relational databases [J]. Acm Transactions on Internet Technology, 2001, 1(1):110-141
  9. Jiang H, Lu H, Wang W, et al. Path materialization revisited: an efficient storage model for XML data[C]// Australasian Database Conference. Australian Computer Society, Inc. 2002:85-94.
  10. Dweib I M. Automatic mapping of XML documents into relational database [J]. University of Hudders eld, 2010.
  11. Arenas M, Barcel P, Libkin L, et al. Relational and XML Data Exchange [J]. 2010, 2(1):112.
  12. Arenas M, Barcel P, Libkin L, et al. Foundations of Data Exchange[C]//Cambridge University Press, 2014.
About the author
GRD JOURNALS

GRD journals(Global Research and Development Journals) is an international open access online publication house which promotes the research works under different domains. For the research enthusiasts, the GRD Journals plays a key role of promoter. GRD journals along with the most popular indexing partners around the world puts its strong efforts for supporting an innovative, new and quality research work to reach maximum people as possible. GRD Journals aims to publish research articles of high quality dealing with issues which sets the new mark for outstanding developments in the field of research. Our quick interface will provide a platform to the research scholars for exchanging significant information and ideas to the world. Benefits Choosing US: *Peer based reviewing *Reviewers from relevant field with strong academics. *Easy, better and Fast publication *procedure Indexing in large number of reputed indexing libraries across world. *Providing E-Certificates and Hard Copy (Optional)

Papers
1,306
Followers
11,826
View all papers from GRD JOURNALSarrow_forward

Related papers

11.Innovative Way for Normalizing XML Document
Alexander Decker

As XML becomes widely used, dealing with redundancies in XML data has become an increasingly important issue. Redundantly stored information can lead not just to a higher data storage cost, but also to increased costs for data transfer and data manipulation, such data redundancies can lead to potential update anomalies. One way to avoid data redundancies is to employ good schema design based on known functional dependencies. This paper presents a graphical approach to model XML documents based on a Data Type Documentation called Graphical Notations-Data Type Documentation (GN-DTD).

View PDFchevron_right
Survey of Mapping XML DTDs (Documents) to Relational Schemas
Abd El-Aziz Ahmed Abd El-Aziz

2013

Extensible Markup Language(XML) [29], [1] is emerging as the data format of the web era. XML has the characteristics, such as the extensibility and self-description, which make it becomes a criterion of data exchanging between applications [9]. In recent years, XML has become the standard format of data representation and exchange in the scientific research and business application. For taking advantage of the potential of XML, effective storage of XML-format data is a technology track that must be solved [16]. This is creating a new set of data management requirements involving XML, such as the need to store and query XML documents. At present, three common technologies can be used to store and retrieve XML documents which are native XML database, Object Oriented Database (OODB), and Relational Database (RDB) [6]. Relational database is possessed of perfectly theory and technology support, and it has well market-based. Using it to store XML data is relatively simple and feasible. Building a correct structure and data mapping relational between them is an issue that needs to be resolved for XML document [16]. The wide variety of XML applications and the mismatch between XML's nested-tree structure and the flat tuples of the relational model make storing XML documents in relational databases as interesting challenges. The problem of transforming XML data from XML files into the tabular data that can be managed by relational database management system is a very interesting problem [21], [16]. In this paper, we present a survey about the recent and previous mapping approaches that map XML documents to RDB. This survey will support the future research and development work as well as to raise the awareness for the presented approaches. In this survey, we study how the various definitions in a given XML DTD, such as elements, attributes, parent-child relationships, and ID-IDREF(s) attributes can be mapped to entities and relationships. How algorithms which map DTD to relational schema and as well as content and structure preserve the functional dependencies during the mapping process in order to produce relations with less redundancy. Finally, How the recent and previous approaches translate XML query languages, such as XQuery and xpath languages into SQL.

View PDFchevron_right
A Comparative Analysis of Managing XML Data in Relational Database
Rosanna Tangorra

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.

View PDFchevron_right
XAPP: An Implementation of SAX-Based Method for Mapping XML Document to and from a Relational Database
Oyenike Oguntunde

The International Arab Journal of Information Technology

Extensible Markup Language (XML) is the standard medium for data exchange among businesses over the Internet, hence the need for effective management. However, since XML was not designed for storage and retrieval, its management has become an open research area in the database community. Existing mapping techniques for XML-to-relational database adopt either the structural mapping or the model mapping. Though numerous mapping approaches have been developed, mapping and reconstruction time had been problematic, especially when the document size is large and can hardly fit into main memory. In this research, an application codenamed XAPP, a new lightweight application that adopts a novel model mapping approach was developed using Simple API for XML (SAX) parser. XAPP accepts a document with or without Document Type Definition (DTD). It implements two algorithms: one maps XML data to a relational database and improves mapping time, and the other reconstructs an XML document from a rela...

View PDFchevron_right
Gn-Dtd: Innovative Way for Normalizing XML Document
Vijay Gulhane

Computer Engineering and Intelligent Systems, 2012

As XML becomes widely used, dealing with redundancies in XML data has become an increasingly important issue. Redundantly stored information can lead not just to a higher data storage cost, but also to increased costs for data transfer and data manipulation, such data redundancies can lead to potential update anomalies. One way to avoid data redundancies is to employ good schema design based on known functional dependencies. This paper presents a graphical approach to model XML documents based on a Data Type Documentation called Graphical Notations-Data Type Documentation (GN-DTD). GN-DTD allows us to capture syntax and semantic of XML documents in a simple way but precise. Using various notations, the important features of XML documents such as elements, attributes, relationship, hierarchical structure, cardinality, sequence and disjunction between elements or attribute are visualize clearly at the schema level. Keywords- XML Model, GN-DTD desig...

View PDFchevron_right

Related topics

  • Relational Database
  • Time and Space Complexity
  • Tree data structure
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2026 Academia. All rights reserved