By Topic

On data allocation with minimum overall communication costs in distributed database design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xuemin Lin ; Dept. of Comput. Sci., Queensland Univ., Qld., Australia ; Orlowska, M. ; Yanchun Zhang

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

Published in:

Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on

Date of Conference:

27-29 May 1993