DocumentCode
1987115
Title
On data allocation with minimum overall communication costs in distributed database design
Author
Lin, Xuemin ; Orlowska, Maria ; Zhang, Yanchun
Author_Institution
Dept. of Comput. Sci., Queensland Univ., Qld., Australia
fYear
1993
fDate
27-29 May 1993
Firstpage
539
Lastpage
544
Abstract
This paper investigates the problem of allocation of database fragments to a network, so that the overall communication cost for processing a given set of transactions is minimized. Presented first is a data allocation algorithm with respect to a “simple strategy” to process transactions. Secondly, we present a dynamic data allocation algorithm which is guaranteed to produce a “locally optimal” data allocation
Keywords
distributed databases; resource allocation; storage allocation; transaction processing; communication cost; data allocation; database fragments; distributed database design; minimum overall communication costs; transactions; Computer networks; Computer science; Costs; Delay; Distributed computing; Distributed databases; Heuristic algorithms; Intelligent networks; Processor scheduling; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on
Conference_Location
Sudbury, Ont.
Print_ISBN
0-8186-4212-2
Type
conf
DOI
10.1109/ICCI.1993.315314
Filename
315314
Link To Document