Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/39889
Title: Applying genetic algorithms in database partitioning
Authors: Ng, V 
Law, DM
Gorla, N
Chan, CK
Issue Date: 2003
Source: SAC '03 Proceedings of the 2003 ACM Symposium on Applied computing, Melbourne, Florida, USA, March 9-12, 2003, p. 544-549 How to cite?
Abstract: One popular technique used to enhance database performace is attribute partitioning. Attribute partitioning is the process of subdividing the attributes of a relation and then grouping them into fragments so as to minimize the number of disk access by all transactions. On the other hand, tuple clustering, which is the process of rearranging the order of tuples so that frequently queried tuples are grouped into as few blocks as possible, is mostly ignored. In this paper, we address the need of considering the n-ary attribute partitioning and tuple clustering at the same time in a relational database. A new algorithm is proposed for mixed fragmentation design using genetic algorithm. Java programs have been developed to implement the genetic algorithm for mixed fragmentation and the results are promising. It provides an improvement over previous works which considered vertical partitioning and tuple clustering separately. Comparisons with exhaustive enumeration and random search are also presented.
URI: http://hdl.handle.net/10397/39889
ISBN: 1-58113-624-2
DOI: 10.1145/952532.952639
Appears in Collections:Conference Paper

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

Page view(s)

37
Last Week
3
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



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