loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Systems and Networks Communication (ICSNC'06)
A Novel Way of Determining the Optimal Location of a Fragment in a DDBS: BGBR
Tahiti, French Polynesia
October 29-November 03
ISBN: 0-7695-2699-3
Ashkan Bayati, University of Tehran
Pedram Ghodsnia, University of Tehran
Maseud Rahgozar, University of Tehran
Reza Basseda, University of Tehran
This paper addresses the problem of determining the optimal location to place a fragment (object) in a distributed non-replicated database. The algorithm defined takes into consideration a changing environment with changing access patterns. This paper contributes by allocating data fragments to their optimal location, in a distributed network, based on the access patterns for that fragment. The mechanism for achieving this optimality relies on knowing the costs involved in moving data fragments from one site to the other. Embedded into the algorithm is a mechanism to prioritize fragments so that if there is a limited space on a specific node where many fragments are chosen to be allocated the ones with higher priority are placed before the lower priority fragments.
Citation:
Ashkan Bayati, Pedram Ghodsnia, Maseud Rahgozar, Reza Basseda, "A Novel Way of Determining the Optimal Location of a Fragment in a DDBS: BGBR," icsnc, pp.64, International Conference on Systems and Networks Communication (ICSNC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.