A Randomised Schema Mutator for Evolutionary Database Optimisation

In this paper we focus on randomised evolutionary optimisation. We introduce a general framework for the optimisation of data models, based on the concept of evolution. This evolution is guided by a randomised schema mutator. Although our approach is expressed in terms of database optimisation, our ideas are applicable to other elds of randomised evolutionary optimisation of computer models, especially when similar (graph structured) models are used.

[1]  Hasan Pirkul,et al.  An integrated model of record segmentation and access path selection for databases , 1988, Inf. Syst..

[2]  P. Bruce Berra,et al.  Minimum cost selection of secondary indexes for formatted files , 1977, TODS.

[3]  Georg Gottlob,et al.  Translating SQL Into Relational Algebra: Optimization, Semantics, and Equivalence of SQL Queries , 1985, IEEE Transactions on Software Engineering.

[4]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5]  Hans-Jörg Schek,et al.  The relational model with relation-valued attributes , 1986, Inf. Syst..

[6]  Patrick van Bommel,et al.  Towards Database Optimization by Evolution , 1992, CISMOD.

[7]  Peter P. Chen.  The entity-relationship model: toward a unified view of data , 1975, VLDB '75.

[8]  G. M. Nijssen,et al.  Conceptual schema and relational database design - a fact oriented approach , 1989 .

[9]  Rina Dechter.  Decomposing a Relation into a Tree of Binary Relations , 1990, J. Comput. Syst. Sci..

[10]  P. V. Bommel,et al.  Database Design Modifications based on Conceptual Modelling , 1994 .

[11]  György Kovács,et al.  Transformation of database populations and operations from the conceptual to the internal level , 1994, Inf. Syst..

[12]  Terry A. Halpin.  A Fact-Oriented Approach to Schema Transformation , 1991, MFDBS.

[13]  Arthur H. M. ter Hofstede,et al.  Semantics and verification of object-role models , 1991, Inf. Syst..

[14]  Arthur H. M. ter Hofstede,et al.  Uniquest: Determining the Semantics of Complex Uniqueness Constraints , 1992, Comput. J..

[15]  James A. Thom,et al.  TQL: A Nested Relational Query Language , 1991, Aust. Comput. J..

[16]  C. M. R. Leung,et al.  Relational database design using the NIAM conceptual schema , 1988, Inf. Syst..

[17]  Abraham Silberschatz,et al.  Extended algebra and calculus for nested relational databases , 1988, TODS.

[18]  A. Amikam.  On the automatic generation of optimal internal schemata , 1985, Inf. Syst..

[19]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[20]  Vijay V. Raghavan,et al.  On the Selection of an Optimal Set of Indexes , 1983, IEEE Transactions on Software Engineering.

[21]  John R. Koza,et al.  A Hierarchical Approach to Learning the Boolean Multiplexer Function , 1990, FOGA.

[22]  Riva Wenig Bickel,et al.  Tree Structured Rules in Genetic Algorithms , 1987, ICGA.

[23]  Latha S. Colby.  A recursive algebra for nested relations , 1990, Inf. Syst..

[24]  Patrick van Bommel,et al.  Reducing the search space for conceptual schema transformation , 1992, Data Knowl. Eng..

[25]  D. A Jardine,et al.  Concepts and terminology for the conceptual schema and the information base , 1984 .

[26]  Arthur H. M. ter Hofstede,et al.  Expressiveness in Conceptual Data Modelling , 1993, Data Knowl. Eng..

[27]  K. K. Benke,et al.  A Direct Search Algorithm for Global Optimisation of Multivariate Functions , 1991, Aust. Comput. J..