Please use this identifier to cite or link to this item:
Title: Mapping XML schema to relations using genetic algorithm
Authors: Ng, V 
Chan, CK
Chan, S 
Keywords: XML schema
Relational database
Genetic algorithms
Issue Date: 2004
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), v. 3215, p. 232-245 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: As web-applications grow in number and complexity, there is a need for efficient mappings from XML schemas to the flat relational tables so that existing functions in relational database systems can be utilized. However, many of the existing mapping methods, such as the model-based or the structure-based methods, do not exploit query history for better query performance. In this paper, we propose the use of genetic algorithm (GA) in a cost-based approach for converting a XML schema to relational tables. By formulating the mapping problem as a cost optimization task with respect to a set of weighted frequent queries, we can obtain an efficient mapping that minimizes the queries execution time. In our experiments, we show that the mapping obtained by GA is superior to other non-cost-based approaches. In particular, the GA approach has out-performed the greedy heuristic in the browsing queries where the accessed attributes are many and scattered.
Description: 8th International Conference Knowledge-Based Intelligent Information and Engineering Systems (KES 2004),Wellington, New Zealand, September 20-25, 2004
ISBN: 978-3-540-23205-6 (print)
978-3-540-30134-9 (online)
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-540-30134-9_33
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



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