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 Department of Computer Engineering SIT, Lonavala, Pune, India
Shital Harihar Department of Computer Engineering SIT, Lonavala, Pune, India
Vandna Adhude Department of Computer Engineering SIT, Lonavala, Pune, India
Prof. Prashant Raut Department of Computer Engineering 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