DocumentCode
3040648
Title
Optimal allocation for partially replicated database systems on tree-based networks
Author
Stephens, A.B. ; Yesha, Yelena ; Humenik, Keith
Author_Institution
Dept. of Comput. Sci., Maryland Univ., Baltimore, MD, USA
fYear
1992
fDate
1-3 April 1992
Firstpage
125
Lastpage
131
Abstract
The authors consider a partially replicated distributed database located on a tree network each of whose links may fail with a probability p. For small p they derive necessary conditions for optimal placement of copies in order to maximize the probabilities of successful read-only and write-only transactions. These results suggest several heuristics for general networks. Numerical results are presented.<>
Keywords
database theory; distributed databases; tree data structures; distributed database; partially replicated database; read-only; tree-based networks; write-only; Availability; Computer networks; Computer science; Concurrent computing; Costs; Database systems; Distributed databases; Protocols; Transaction databases; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location
Scottsdale, AZ, USA
Print_ISBN
0-7803-0605-8
Type
conf
DOI
10.1109/PCCC.1992.200548
Filename
200548
Link To Document