Title :
Optimal data migration policies in distributed databases
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
A description is given of how to determine the optimal migration policy for data items in a distributed database. A migration policy determines whether remote execution or migration is used when a remote request on a data item is initiated. A migration policy is modeled using a discrete Markov chain. The states in the Markov chain encode the history of previous requests and determine the probability distribution of the location of future requests. A modified policy iteration procedure is used to determine the optimal policy
Keywords :
Markov processes; distributed databases; discrete Markov chain; distributed databases; optimal data migration; policy iteration procedure; probability distribution; remote execution; Computer science; Concurrency control; Costs; Displays; Distributed databases; History; Probability distribution;
Conference_Titel :
Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International
Conference_Location :
Tokyo
Print_ISBN :
0-8186-2152-4
DOI :
10.1109/CMPSAC.1991.170255
