IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 11    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 11, November 2011
A Stochastic Simulation of Optimized Access Strategies for a Distributed Database Design
Full Text(PDF, 3000)  PP.  
Author(s)
Rajinder Singh, Gurvinder Singh, Varinder Pannu virk
KEYWORDS
Stochastic Simulation, Genetic Algorithms, Distributed Database, Access Strategies, Query Optimization, Fragments, sub-query operation, Computer Network, Random Number Generation, Query Tree
ABSTRACT
This paper highlights a design of a probabilistic solution to the operation allocation problem of Distributed Databases. Most of the present day commercial vendors of Distributed DBMS use deterministic procedures along with certain heuristics on exhaustive enumeration procedures like Dynamic Programming, Greedy Techniques, Randomized strategies etc. These procedures have a lot of scope for improvements when problem domain is increased from the point of view of 'number of sites' or 'number of joins' involved in a distributed query. Recently great interest has been shown by researchers to apply Genetic Algorithms to achieve this. This paper highlights design and implementation of one such model, Genetic Algorithm for Subquery Allocation (GA_SA), which is a modest effort to stochastically simulate optimization of retrieval transactions for a distributed query.
References
[1] Garey, M., D.Johnson Computers and Intractability: A Guide to the Theory of NP completeness, W.H.Freeman, 1979.

[2] M.Tamer,Ozsu,Patrick Valduriez: Principles of Distributed Database Sys-tems, Dorling Kindersley, 2006.

[3] Douglas W, Cornell and Philip S Yu,‖ On Optimal Site Assignment or Re-lations in the Distributed Database Environment‖, IEEE Transactionson Soft-ware Engineering, vol 15, no. -8, Aug-1989.

[4] Martin, Lam, Russel ,‖ An Evaluation Of Site Selection Algorithm For Distributed Query Processing‖, The Computer Journal,vol33,1990.

[5] Ram NarsimhanNetwork Outputs, with Relationships to Statistical Pattern Recognition,‖ Neurocomputing—Algorithms, Architectures and Applications, F. Fogelman-Soulie and J. Herault, eds., NATO ASI Series F68, Berlin: Springer-Verlag, pp. 227-236, 1989. (Book style with paper title and editor)

[6] March. S .T, Rho. ‖Allocating Data and Operations to Nodes in distributed Database Design‖ IEEE Transactions on Knowledge and Data Engineering:pp. 305- 317,7April,1995.

[7] Cosar & Sevinc,‖ An Evolutionary Genetic Algorithm for optimiza-tion of Distributed Database Queries‖, The Computer Journal, vol.54, no.5,pp.717-725,2011.

[8] Martin, Lam, Russel ,‖ An Evaluation Of Site Selection Algo-rithm For Distributed Query Processing‖, The Computer Jour-nal,vol33,1990.

[9] March. S .T, Rho. ‖ Allocating Data and Operations to Nodes in distributed Database Design‖ IEEE Transactions on Knowledge and Data Engineering :pp. 305- 317,7April,1995.

[10] Kossmann D, ―The State of Art in Distributed Query Optimization, ― ACM Computing Surveys, Sep 2000.

[11] Amol V. Deshpande and Joseph M. Hellerstein,‖ Decoupled Query Optimizationfor Fedrated Database Systems,‖ A Project Report, Uni-versityof California Berkeley,April 2001.

[12] Stefano Ceri,Giuseppe Pelagatti,‖Allocation of Operations in Distributed Database Access,‖ IEEE Transactionson on Computer, vol.C- 31, no. -2, Feb-19892

[13] P.R.Ma, E.Y.S Lee and M.Tsuchiya, ―A task allocation model for distributed computing systems,‖ IEEE Transactions on Computers C-31(1),41-47(1982)

Untitled Page