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.
关键词
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 条
[41]  
Schwetman H., CSIM users' guide, MCC Technical Report No. ACT-126-90, (1990)
[42]  
Selinger P., Predictions and challenges for database systems in the year 2000, Proc. VLDB Conf, (1993)
[43]  
Sellis T., Multiple query optimization, ACM TODS, 13, 1, (1988)
[44]  
Shatdal A., Naughton J., Using shared virtual memory for parallel join processing, Proc. ACM SIGMOD Conf., (1993)
[45]  
Stellwagen R., (1993)
[46]  
A benchmark of non-stop SQL on the debit credit transaction, Proc: ACM SIGMOD Conf., (1988)
[47]  
Corp T., DBC/1012 data base computer system manual, Teradata Corp. Document No. C10-000/-02, (1985)
[48]  
Walton C., Et al., A taxonomy and performance model of data skew in parallel joins, Proc. VLDB Conf., (1991)
[49]  
Weikum G., Zabback P., Scheurmann P., Dynamic file allocation in disk arrays, Proc. ACM SIGMOD Conf., (1991)
[50]  
Weikum G., Zabback, Tuning of striping units in disk-array-based file systems, Proc. RIDE-TQP Workshop, (1992)