Article

Free access

A genetic algorithm for fragment allocation in a distributed database system

Authors:

Arthur L. Corcoran,

John HaleAuthors Info & Claims

SAC '94: Proceedings of the 1994 ACM symposium on Applied computing

Pages 247 - 250

https://doi.org/10.1145/326619.326738

Published: 06 April 1994 Publication History

PDF eReader

References

[1]

D. A. Bell. Difficult data placement problems. Computer J., 27(4). 1992.

Google Scholar

[2]

D. A. Bell and J. Grimson. Distributed Database Systems. Addison-Wesley, Menlo Park, California, 1992.

Digital Library

Google Scholar

[3]

S. Geri, G. Martella, and G. Pelagatti. Optimal file allocation for a distributed databasee on a network of minicomputers. In Proc. ICOD I Conf., Aberdeen, Scotland, 1980.

Google Scholar

[4]

C. C. Chang and Shielke. On the complexity of the file allocation problem. In Conf. on Foundations of Data Organisation, Kyoto, Japan, 1985.

Google Scholar

[5]

A. L. Corcoran and R. L. Wainwright. LibGA: A userfriendly workbench for order-based genetic algorithm research. In E. Deaton, K. M. George. H. Berghel, and G. Hedrick, editors, Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, pages 111-118, New York, 1993, ACM Press.

Digital Library

Google Scholar

[6]

R. Elmasri and S. B. Navathe. Fundamentals of Database Systems. Benjamin/Cummings, Redwood City, California, 1989.

Digital Library

Google Scholar

[7]

M.R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco. 1979.

Digital Library

Google Scholar

[8]

D. E. Goldberg. Genetic Algorithms in Search. Optimization, and Machine Le:rning. Addison-Wesley, Reading, Massachusetts, 1989.

Digital Library

Google Scholar

[9]

J. H. Holland, Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, Michigan, 1975.

Digital Library

Google Scholar

[10]

M. T. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, Englewood Cliffs, New Jersey, 1991.

Digital Library

Google Scholar

[11]

J. T. Richardson. M. R. Palmer, G. E. Liepens, and M. Hilliard. Some guidelines for genetic algorithms with penalty functions. In J. D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, Arlington, Virginia, 1989, Morgan Kaufmann.

Digital Library

Google Scholar

[12]

D. Whitley and J. Kauth, GENITOR: A different genetic algorithm. In Proceedings of the Rocky Mountain Colorado, on Artificial Intelligence, pages 118-130, Denver, Colorado, 1988.

Google Scholar

Cited By

View all

Singh AKhehra BMavi B(2021)Simplified-BBO for Non-redundant Allocation of Data in Distributed Database Design2021 IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)10.1109/MWSCAS47672.2021.9531836(544-548)Online publication date: 9-Aug-2021
https://doi.org/10.1109/MWSCAS47672.2021.9531836
Nashat DAmer A(2018)A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database DesignACM Computing Surveys10.1145/315022351:1(1-25)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3150223
Reeves C(2018)Genetic AlgorithmsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_562(1583-1587)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_562
Show More Cited By

Index Terms

A genetic algorithm for fragment allocation in a distributed database system

Recommendations

Robust and distributed genetic algorithm for ordering problems
HPDC '96: Proceedings of the 5th IEEE International Symposium on High Performance Distributed Computing

The paper presents a distributed genetic algorithm implementation for obtaining good quality consistent results for different ordering problems. Most importantly, the solution found by the proposed Distributed GA is not only of high quality but also ...
When a genetic algorithm outperforms hill-climbing

A toy optimisation problem is introduced which consists of a fitness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of ...
Neural network crossover in genetic algorithms using genetic programming
Abstract
The use of genetic algorithms (GAs) to evolve neural network (NN) weights has risen in popularity in recent years, particularly when used together with gradient descent as a mutation operator. However, crossover operators are often omitted from ...

Comments

Information & Contributors

Information

Published In

SAC '94: Proceedings of the 1994 ACM symposium on Applied computing

April 1994

598 pages

ISBN:0897916476

DOI:10.1145/326619

Chairmen:
Hal Berghel
Univ. of Arkansas, Fayetteville
,
Terry Hlengl
Knowledge Technology, Inc; and PC AI Magazine
,
Joseph Urban
Arizona State Univ., Tempe

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 April 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC94

Sponsor:

SAC94: 1994 Symposium on Applied Computing

March 6 - 8, 1994

Arizona, Phoenix, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
1,033
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)1

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

View all

Singh AKhehra BMavi B(2021)Simplified-BBO for Non-redundant Allocation of Data in Distributed Database Design2021 IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)10.1109/MWSCAS47672.2021.9531836(544-548)Online publication date: 9-Aug-2021
https://doi.org/10.1109/MWSCAS47672.2021.9531836
Nashat DAmer A(2018)A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in Distributed Database DesignACM Computing Surveys10.1145/315022351:1(1-25)Online publication date: 4-Jan-2018
https://dl.acm.org/doi/10.1145/3150223
Reeves C(2018)Genetic AlgorithmsEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_562(1583-1587)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_562
Abdel Raouf ABadr NTolba M(2018)Dynamic data reallocation and replication over a cloud environmentConcurrency and Computation: Practice and Experience10.1002/cpe.441630:13Online publication date: 17-Jan-2018
https://doi.org/10.1002/cpe.4416
Reeves C(2017)Genetic AlgorithmsEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_562-2(1-5)Online publication date: 11-Jan-2017
https://doi.org/10.1007/978-1-4899-7993-3_562-2
Chen ZYang SShang YLiu YWang FWang LFu J(2016)Fragment Re-Allocation Strategy Based on Hypergraph for NoSQL Database SystemsInternational Journal of Grid and High Performance Computing10.4018/IJGHPC.20160701018:3(1-23)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.4018/IJGHPC.2016070101
Abdel Raouf ABadr NTolba M(2016)An Enhanced Distributed Database Design Over the Cloud EnvironmentProceedings of the International Conference on Advanced Intelligent Systems and Informatics 201610.1007/978-3-319-48308-5_28(290-298)Online publication date: 18-Oct-2016
https://doi.org/10.1007/978-3-319-48308-5_28
Abdel Raouf ABadr NTolba M(2016)Distributed Database System (DSS) Design Over a Cloud EnvironmentMultimedia Forensics and Security10.1007/978-3-319-44270-9_5(97-116)Online publication date: 18-Oct-2016
https://doi.org/10.1007/978-3-319-44270-9_5
Chen ZYang STan SHe LYin HZhang G(2015)A new fragment re-allocation strategy for NoSQL database systemsFrontiers of Computer Science: Selected Publications from Chinese Universities10.1007/s11704-014-3480-49:1(111-127)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s11704-014-3480-4
Chen ZYang STan SZhao HHe LZhang GYang H(2014)The Data Allocation Strategy Based on Load in NoSQL DatabaseApplied Mechanics and Materials10.4028/www.scientific.net/AMM.513-517.1464513-517(1464-1469)Online publication date: Mar-2014
https://doi.org/10.4028/www.scientific.net/AMM.513-517.1464
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Robust and distributed genetic algorithm for ordering problems

When a genetic algorithm outperforms hill-climbing

Neural network crossover in genetic algorithms using genetic programming