Abstract
One popular technique used to enhance database performance 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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the ACM Symposium on Applied Computing |
| Pages | 544-549 |
| Number of pages | 6 |
| Publication status | Published - 18 Jul 2003 |
| Event | Proceedings of the 2003 ACM Symposium on Applied Computing - Melbourne, FL, United States Duration: 9 Mar 2003 → 12 Mar 2003 |
Conference
| Conference | Proceedings of the 2003 ACM Symposium on Applied Computing |
|---|---|
| Country/Territory | United States |
| City | Melbourne, FL |
| Period | 9/03/03 → 12/03/03 |
ASJC Scopus subject areas
- Software