论文信息 - On data allocation with minimum overall communication costs in distributed database design

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

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.<<ETX>>

Maria E. Orlowska | Yanchun Zhang | Xuemin Lin

[1] P. Gács,et al. Algorithms , 1992 .

[2] R. Graham,et al. The Shortest-Network Problem , 1989 .

[3] David Maier,et al. The Theory of Relational Databases , 1983 .

[4] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[5] C. J. Date. An Introduction to Database Systems , 1975 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Wesley W. Chu,et al. Optimal File Allocation in a Multiple Computer System , 1969, IEEE Transactions on Computers.

[8] Peter M G Apers,et al. Data allocation in distributed database systems , 1988, TODS.

[9] Maria E. Orlowska,et al. An Efficient Test for the Validity of Unbiased Hybrid Knowledge Fragmentation in Distributed Databases , 1992, Int. J. Softw. Eng. Knowl. Eng..

[10] Domenico Saccà,et al. Database partitioning in a cluster of processors , 1983, TODS.

[11] M. W. Orlowski. On Optimisation of Joins in Distributed Database System , 1992, Future Databases.

[12] Shamkant B. Navathe,et al. Vertical partitioning algorithms for database design , 1984, TODS.