Distributing a database for parallelism
Distributing a database for parallelism
复制标题
分布式数据库以实现并行性
DOI：
10.1145/582192.582201
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
R. Katz
中科院分区：
文献类型：
--
作者：
E. Wong;R. Katz
在本文中，我们将细分数据库并将片段分配给分布式数据库系统中的站点的问题，以最大程度地提高非抑制性并行性。我们的目标是建立一个概念框架来分发数据而不致力于特定的成本模型。我们介绍了“本地足够的”概念作为对并行性的衡量，并展示某些类别的查询如何自然地导致数据库的不缩合分区，以至于在本地足够。对于没有本地分布不足的查询类别，我们提供了引入冗余的方法
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