SHERP

Characterization and Analysis of a Nested Genetic Algorithm for Distributed Database Design

Cited 0 time in webofscience Cited 0 time in scopus
Authors
March, Salvatore T.; Rho, Sangkyu
Issue Date
1996
Publisher
College of Business Administration (경영대학)
Citation
Seoul Journal of Business Vol2(1): 85~121(1996)
Keywords
allocated to node; DDB; Operation allocation
Abstract
Distributed database design is a difficult and complex task involving two
interdependent problems : data allocation and operation allocation. First,
data must be allocated to nodes in the network. Second, given such an allocation,
data must be efficiently retrieved, processed, and possibly communicated
to meet the retrieval and update requirements of the users. The
problem is characterized by integer variables, a discontinuous and extremely
complex cost function, and numerous constraints. A nested genetic algorithm
naturally fits this problem formulation with the outer algorithm addressing
data allocation and the inner algorithm addressing operation allocation. We
present and characterize such an algorithm according to its gene structure
and control parameters. We experimentally analyze the effects of poolsize
and crossover operator on the performance of our algorithm.
Index Terms - Genetic algorithms, performance modeling and analysis, experimental
analysis of algorithms, distributed database design
ISSN
1226-9816
Language
English
URI
http://hdl.handle.net/10371/1764
Files in This Item:
Appears in Collections:
College of Business Administration/Business School (경영대학/대학원)Dept. of Business Administration (경영학과)Seoul Journal of BusinessSeoul Journal of Business Volume 02, Number 1 (1996)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse