Summary
The design of distributed databases requires a configuration of the data such that queries are satisfied by accessing a minimum number of locations and the system load is equitably distributed among all locations. This problem is called the File Design Problem. This problem is NP Hard and requires the optimization over conflicting objectives. A genetic algorithm based on multi niche crowding combines heuristics with parallel processing to provide a suitable approach to solve this problem. Performance of the algorithm is tested using multiple data sets on different system platforms. The new method holds promise in providing suitable solutions for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cedeño, W. (1995). The multi-niche crowding genetic algorithm: analysis and applications. UMI Dissertation Services, 9617947.
Cedeño, W., Vemuri, V., and Slezak, T. (1995). Multi-Niche crowding in genetic algorithms and its application to the assembly of DNA restriction-fragments. Evolutionary Computation, 2:4, 321–345.
Cedeño, W. and Vemuri, V. (1996). Genetic algorithms in aquifer management. Journal of Network and Computer Applications, 19, 171–187, Academic Press.
Cobb, H. J. and Grefenstette, J. J. (1993). Genetic algorithms for tracking changing environments. In S. Forrest (ed.) Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers San Mateo, California, 523–530.
Darwin, C. (1859). On the Origin of Species by Means of Natural Selection.
Dasgupta, D. & McGregor, D. R. (1992). Non-stationary function optimization using the structured genetic algorithm. In R. Manner and B. Manderick (eds.), Parallel Problem Solving from Nature2, Amsterdam: North Holland, 145–154.
Davidor, Y. (1991). A naturally occurring niche & species phenomenon: The model and first results. In R. K. Belew and L. B. Booker, (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 257–263.
De Jong, K. A. (1975). An analysis of the behaviour of a class of genetic adaptive systems. Doctoral dissertation, University of Michigan. Dissertation Abstracts International 36(0), 5140B. (University Microfilms No. 76–9381).
Deb, K. and Goldberg, D. E. (1989). An investigation of niche and species formation in genetic function optimization. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 42–50.
Falkenauer, E. and Delchambre, A. (1992). A genetic algorithm for bin packing and line balancing. Proceedings of the 1992 IEEE International Conference on Robotics and Automation.
Gorges-Schleuter, M. (1989). ASPARAGOS an asynchronous parallel optimization strategy. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 422–427.
Goldberg D. E. & Smith R. E. (1987). Non-stationary function optimization using genetic algorithms with dominance and diploidy. In J. J. Grefenstette (Ed.), Proceedings of the Second International Conference on Genetic Algorithms, Hillsdale, NJ: Lawrence Erlbaum Associates
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization math Machine Learning. Reading MA: Addison-Wesley.
Gordon, V.S., Whitley, D., and Böhm, A.P.W. (1992). Dataflow parallelism in genetic algorithms. In R. Manner and B. Manderick (eds.), Parallel Problem Solving from Nature 2, Elsevier Science Publishers.
Grefenstette, J.J. (1981). Parallel adaptive algorithms for function optimization. Technical Report No. CS-81–19, Vanderbilt University, Computer Science Department.
Holland, J. H. (1975). Adaptation in natural and artificial systems, Ann Arbor MI: The University of Michigan Press.
Liang, J., Chang, C. C., Lee, R. C. T., and Wang, J. S. (1991). Solving the file design problem with neural networks. Tenth Annual International Phoenix Conference on Computers and Communications.
McGraw, J., et. al. (1985). SISAL — Streams and iterations in a singleassignment language. Language reference manual, version 1.2. Lawrence Livermore National Laboratory manual M-146 (Rev. 1), Livermore, CA
Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs. New York, NY: Springer-Verlag.
Mühlenbein, H. (1989). Parallel genetic algorithms, population genetics and combinatorial optimization. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 416–421.
Ng, K. P. & Wong, K. C. (1995). A new diploid scheme and dominance change mechanism for non-stationary function optimization. In L. J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, San Mateo, CA:Morgan Kaufmann, 159–166.
Spiessens, P. and Manderick, B. (1991). A massively parallel genetic algorithm — implementation and first analysis. In R. K. Belew and L. B. Booker, (Eds.), Proceedings Fourth International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 279–287.
Syswerda, G. and Palmucci, J. (1991). The application of genetic algorithms to resource scheduling. In R. K. Belew and L. B. Booker, (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 502–508.
Tanese, R. (1989). Distributed genetic algorithms. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 434–440.
Whitley, D., Starkweather, T., & Fugway, D. (1989). Scheduling problems and traveling salesmen: the genetic edge recombination operator. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms, San Mateo, CA: Morgan Kaufmann, 133–140.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Cedeño, W., Vemuri, V.R. (1997). Database Design with Genetic Algorithms. In: Dasgupta, D., Michalewicz, Z. (eds) Evolutionary Algorithms in Engineering Applications. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03423-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-03423-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08282-5
Online ISBN: 978-3-662-03423-1
eBook Packages: Springer Book Archive