Distributing a database for parallelism

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

REFERENCES

• 1: {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).
• 2: Peter Pin-Shan Chen, The entity-relationship model—toward a unified view of data, ACM Transactions on Database Systems (TODS), v.1 n.1, p.9-36, March 1976 [doi>10.1145/320434.320440]
• 3: {CHU73} Chu, W.W., "Optimal Allocation of Files in Computer Networks," in Computer Communications Networks, Prentice-Hall, Englewood Cliffs, NJ, 1973.
• 4: Samy Mahmoud , J. S. Riordon, Optimal allocation of resources in distributed information networks, ACM Transactions on Database Systems (TODS), v.1 n.1, p.66-78, March 1976 [doi>10.1145/320434.320449]
• 5: Eugene Wong , Randy H. Katz, Logical Design and Schema Conversion for Relational and DBTG Databases, Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design, p.311-322, January 1980
• 6: {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).