Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/513231Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Kamsuriah Ahmad, Prof. Madya Dr. | |
| dc.contributor.author | Amjad Faisal Ali Qtaish (P68516) | |
| dc.date.accessioned | 2023-10-16T04:34:54Z | - |
| dc.date.available | 2023-10-16T04:34:54Z | - |
| dc.date.issued | 2016-03-22 | |
| dc.identifier.other | ukmvital:83252 | |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/513231 | - |
| dc.description | XML has become a common language for data exchange in the web, therefore it needs a proper management. There are four central problems in XML management: capture, storage, retrieval, and exchange of data. Even though there exist numerous database systems, relational database (RDB) are often used to store and query the contents of XML documents. Therefore the processes of mapping from XML to RDB and vice versa are one that occurs frequently. Numerous researchers have proposed various mapping approaches that mapped the hierarchical nature of XML documents into the tabular format of RDB. However, the existing approaches have faced problems in terms of storage and query response time. If the design of RDB is not done efficiently, the number of join operations between tables will increased when queried, which consequently affects the query response time. Therefore, there is a need to propose a new mapping approach for XML documents to overcome this limitation. This study aims to propose 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. While XtoSQL algorithm translates XPath queries into corresponding SQL queries based on the constructed RDB, in order to reduce query response time. The basic idea of XAncestor is to map distinct ancestor paths, for all leaf nodes of the XML tree, with their structural information into its RDB: instead of mapping the whole document (inner and leaf nodes) with the information paths from the root (node-paths or leaf-paths). The proposed algorithms able to reduce the RDB storage space, the search space, the number of join operations, and the nesting queries of the translated SQL query. The two algorithms used in XAncestor are then developed as a prototype in order to test for their effectiveness. The results of the two algorithms used in XAncestor are compared with the results produced by the other five similar approaches. The comparisons prove that the proposed algorithms overcome the existing approaches, in terms of the effectiveness and scalability. The two algorithms used in XAncestor are verified in terms of the correctness and completeness. It is hoped that the proposed XAncestor approach contributes to commercial organizations in exchanging and managing their data efficiently on the web in terms of the storage size and queries. The proposed approach also serves as an introductory material for researchers who wish to enhance the mapping components and extension into new research areas.,Certification of Master's/Doctoral Thesis" is not available | |
| dc.language.iso | eng | |
| dc.publisher | UKM, Bangi | |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
| dc.rights | UKM | |
| dc.subject | Xancestor | |
| dc.subject | Mapping approach | |
| dc.subject | Algorithm | |
| dc.subject | XML documents | |
| dc.subject | Dissertations, Academic -- Malaysia | |
| dc.title | Xancestor: a mapping approach for storing and querying XML documents in relational database using path-based technique | |
| dc.type | Theses | |
| dc.format.pages | 125 | |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_83252+SOURCE1+SOURCE1.0.PDF Restricted Access | 612.22 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.