Numerous decision support applications have been modeled as set covering and partitioning problems. We propose an extension to the database query language SQL to enable applications of these problems to be stated and solved directly by the database system. This will lead to the benefits of improved data independence, increased productivity and better performance. Six operators, namely cover, mincover, sumcover, partition, minpartition, and sumpartition are extended. In this paper, we presented genetic algorithms for the implementation of access routines for the proposed operators. We found that our genetic algorithm approach for extended operations and query optimization performed well both on the computational effort and the quality of the solutions through a variety of test problems. This approach makes it possible for a DBMS to respond to queries involving the proposed operators in a predicate restricted amount of time.
|Number of pages||6|
|State||Published - 1994|
|Event||Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2) - Orlando, FL, USA|
Duration: 27 Jun 1994 → 29 Jun 1994
|Conference||Proceedings of the 1st IEEE Conference on Evolutionary Computation. Part 1 (of 2)|
|City||Orlando, FL, USA|
|Period||27/06/94 → 29/06/94|