Skip Navigation

The Computer Journal 2000 43(1):81-93; doi:10.1093/comjnl/43.1.81
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Song, S.-K.
Right arrow Articles by Gorla, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Genetic Algorithm for Vertical Fragmentation and Access Path Selection

Suk-Kyu Song1 and Narasimhaiah Gorla2

1 Youngsan University, Pusan, Korea Email: Nara.Gorla@uc.edu 2 University of Cincinnati, Cincinnati, Ohio, USA

Vertical fragmentation and access path selection are interdependent techniques in physical database design used to enhance performance in database systems. While vertical fragmentation in relational databases deals with assignment of attributes to physical files, access path selection deals with searching efficiently the physical location of data records. Vertical fragmentation is a combinatorial optimization problem that is NP-hard in most cases. We propose a genetic algorithm approach for the vertical fragmentation problem while addressing access path selection. The effectiveness and efficiency of the genetic algorithm are illustrated through several database design problems, ranging from 10 attributes/5 transactions to 30 attributes/18 transactions. In most cases, our design solutions match the global optimum solutions obtained from an exhaustive enumeration. Compared to unpartitioned databases, our design solution results in substantial savings (up to 80%) in the number of disk accesses.

Received 6 September, 1994. Revised 14 November, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.