Abstract
In this paper we treat the problem of subdividing a database and allocating the fragments to the sites in a distributed database system in order to maximize non-duplicative parallelism. Our goal is to establish a conceptual framework for distributing data without being committed to specific cost models.We introduce the concept of "local sufficiency" as a measure of parallelism, and show how certain classes of queries lead naturally to irredundant partitions of a database that are locally sufficient. For classes of queries for which no irredundant distribution is locally sufficient, we offer ways to introduce redundancy in achieving local sufficiency
- {APER80} Apers, P.M.G., "Redundant Allocation of Relations in a Communications Network," Proc. Fifth Berkeley Workshop on Distributed Data Management and Computer Networks (Feb. 1981).Google Scholar
- {CHEN76} Chen, P.P., "The Entity-Relationship Model-Toward a Unified View of Data," ACM Trans. Database Systems, V1, N1 (Mar, 1976). Google ScholarDigital Library
- {CHU73} Chu, W.W., "Optimal Allocation of Files in Computer Networks," in Computer Communications Networks, Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar
- {MAHO76} Mahoud, S., J.S. Riordan, "Optimal Allocation of Resources in Distributed Information Networks," ACM Trans. on Database Systems, V1, N1 (Mar. 1976). Google ScholarDigital Library
- {WONG79} Wong, E., Katz, R.H., "Logical Design and Schema Conversion for Relational and DBTG Databases," Proc. Intl. Conference on Entity-Relationship Approach to Systems Analysis and Design (Dec. 1979). Google ScholarDigital Library
- {WONG81} Wong, E., "Dynamic Re-Materialization: Processing Distributed Queries Using Redundant Data," Proc. Fifth Berkeley Workshop on Distributed Data Management and Computer Networks (Feb. 1981).Google Scholar
Index Terms
- Distributing a database for parallelism
Recommendations
Distributing a database for parallelism
SIGMOD '83: Proceedings of the 1983 ACM SIGMOD international conference on Management of dataIn this paper we treat the problem of subdividing a database and allocating the fragments to the sites in a distributed database system in order to maximize non-duplicative parallelism. Our goal is to establish a conceptual framework for distributing ...
Comments