On data allocation with the minimum overall communication costs in distributed database design (1993)
by
Xuemin Lin
,
Maria Orlowska
,
Yanchun Zhang
| Venue: | in Distributed Database Design. In: Proc. of ICCI'93 |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Lin93ondata,
author = {Xuemin Lin and Maria Orlowska and Yanchun Zhang},
title = {On data allocation with the minimum overall communication costs in distributed database design},
booktitle = {in Distributed Database Design. In: Proc. of ICCI'93},
year = {1993},
pages = {539--544}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. 1.
Citations
| 985 | Graph Theory with Applications - Bondy, Murty - 1976 |
| 384 | Theory of Relational Databases - Maier - 1983 |
| 162 | Computers and Intractability—A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979 |
| 75 | Vertical partitioning algorithms for database design - Navathe, Ceri, et al. - 1984 |
| 61 | Data allocation in distributed database systems - Apers - 1988 |
| 51 | Optimal file allocation in multiple computing system - Chu - 1969 |
| 22 | The shortest network problem - Bern, Graham - 1989 |
| 21 | Database partitioning in a cluster of processors - Sacca, Wiederhold - 1985 |
| 2 | An Introduction to Database System, Vol 2 - Date - 1982 |
| 1 | On Optimisation of Joins - Orlowski - 1992 |
| 1 | An Efficient Test for the Validity of Hybrid Knowledge Fragmentation in Distributed Databases - Zhang, Orlowska, et al. - 1992 |
