Distributing a Database for Parallelism.

Abstract
In this paper the authors 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. Their goal is to establish a conceptual framework for distributing data without being committed to specific cost models. They 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, ways to introduce redundancy in achieveing local sufficiency are introduced.

This publication has 0 references indexed in Scilit: