Please use this identifier to cite or link to this item: https://doi.org/10.1007/s10479-008-0361-y
Title: Towards optimal workload-aware XML to relational schema mapping
Authors: Wang, X.
Luan, J.
Liu, G. 
Zhou, A.
Keywords: DTD
Generic algorithm
Relational schema
XML
Issue Date: 2009
Source: Wang, X., Luan, J., Liu, G., Zhou, A. (2009). Towards optimal workload-aware XML to relational schema mapping. Annals of Operations Research 168 (1) : 133-150. ScholarBank@NUS Repository. https://doi.org/10.1007/s10479-008-0361-y
Abstract: Storing XML documents in relational databases has drawn much attention in recent years because it can leverage existing investments in relational database technologies. Different algorithms have been proposed to map XML DTD/Schema to relational schema in order to store XML data in relational databases. However, most work defines mapping rules based on heuristics without considering application characteristics, hence fails to produce efficient relational schema for various applications. In this paper, we propose a workload-aware approach to generate relational schema from XML data and user specified workload. Our approach adopts the genetic algorithm to find optimal mappings. An elegant encoding method and related operations are proposed to manipulate mappings using bit strings. Various techniques for optimization can be applied to the XML to relational mapping problem based on this representation. We implemented the proposed algorithm and our experiment results showed that our algorithm was more robust and produced better mappings than existing work. © 2008 Springer Science+Business Media, LLC.
Source Title: Annals of Operations Research
URI: http://scholarbank.nus.edu.sg/handle/10635/39723
ISSN: 02545330
DOI: 10.1007/s10479-008-0361-y
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

33
checked on Dec 19, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.