Data placement in shared-nothing parallel database systems

被引：51

作者：

Mehta M. ^{[1
]}

DeWitt D.J. ^{[2
]}

机构：

[1] San Jose, CA 95113, 12, S. First St.

[2] Madison, WI 53706, 1210, W. Dayton St.

来源：

The VLDB Journal | 1997年 / 6卷 / 1期

关键词：

Declustering; Disk allocation; Resource allocation; Resource scheduling;

D O I：

10.1007/s007780050033

中图分类号：

学科分类号：

摘要：

Data placement in shared-nothing database systems has been studied extensively in the past and various placement algorithms have been proposed. However, there is no consensus on the most efficient data placement algorithm and placement is still performed manually by a database administrator with periodic reorganization to correct mistakes. This paper presents the first comprehensive simulation study of data placement issues in a shared-nothing system. The results show that current hardware technology trends have significantly changed the performance tradeoffs considered in past studies. A simplistic data placement strategy based on the new results is developed and shown to perform well for a variety of workloads.

引用

页码：53 / 72

页数：19

共 56 条

[1]

Bitton D., Gray J., Disk shadowing, Proc. VLDB Conf., (1988)

[2]

Boral H., Et al., Prototyping Bubba, a highly parallel database system, IEEE Transactions on Knowledge and Data Engineering, 2, 1, (1990)

[3]

Brown K., Carey M., Dewitt D., Mehta M., Naughton J., Resource allocation and scheduling for mixed database workloads, Computer Sciences Technical Report #1095, (1992)

[4]

Brown K., Carey M., Livny M., Managing memory to meet multiclass workload response time goals, Proc. VLDB Conf, (1993)

[5]

Brown K., Mehta M., Carey M., Livny M., Towards automated performance timing for complex workloads, Proc. VLDB Conf., (1994)

[6]

Ceri S., Pelagatti G., Distributed Databases: Principles and Systems, (1984)

[7]

Chen M.-S., Et al., Using segmented right-deep trees for the execution of pipelined hash joins, Proc. VLDB Conf., (1992)

[8]

Chen M.-S., Et al., Scheduling and processor allocation for parallel execution of multi-join queries, Proc. 8th IEEE Data Engineering Conf., (1992)

[9]

Copeland G., Khoshafian S., A decomposition storage model, Proc. ACM SIGMOD Conf., (1985)

[10]

Copeland G., Et al., Data placement in Bubba, Proc. ACM SIGMOD Conf., (1988)

← 1 2 3 4 5 6 →