An Object Placement Advisor for DB2 Using Solid State Storage

被引:32
作者
Canim, Mustafa [1 ]
Mihaila, George A. [2 ]
Bhattacharjee, Bishwaranjan [3 ]
Ross, Kenneth A. [4 ]
Lang, Christian A. [3 ]
机构
[1] Univ Texas Dallas, Richardson, TX 75083 USA
[2] IBM Watson Res Ctr, Hawthorne, NY USA
[3] IBM Watson Res Ctr, Hawthorne, NY 10598 USA
[4] Columbia Univ, New York, NY USA
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2009年 / 2卷 / 02期
关键词
D O I
10.14778/1687553.1687557
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
Solid state disks (SSDs) provide much faster random access to data compared to conventional hard disk drives. Therefore, the response time of a database engine could be improved by moving the objects that are frequently accessed in a random fashion to the SSD. Considering the price and limited storage capacity of solid state disks, the database administrator needs to determine which objects (tables, indexes, materialized views, etc.), if placed on the SSD, would most improve the performance of the system. In this paper we propose a tool called "Object Placement Advisor" for making a wise decision for the object placement problem. By collecting profile inputs from workload runs, the advisor utility provides a list of objects to be placed on the SSD by applying heuristics like the greedy knapsack technique or dynamic programming. To show that the proposed approach is effective in conventional database management systems, we have conducted experiments on IBM DB2 with queries and schemas based on the TPC-H and TPC-C benchmarks. The results indicate that using a relatively small amount of SSD storage, the response time of the system can be reduced significantly by considering the recommendation of the advisor.
引用
收藏
页码:1318 / 1329
页数:12
相关论文
共 31 条
[1]
Aggarwal G, 2005, LECT NOTES COMPUT SC, V3363, P189
[2]
Agrawal S, 2005, P 2005 ACM SIGMOD IN, P930, DOI [10.1145/1066157.1066292, DOI 10.1145/1066157.1066292]
[3]
Agrawal S., 2006, P 2006 ACM SIGMOD IN, P683
[4]
Ailamaki A., 2001, Proceedings of the 27th International Conference on Very Large Data Bases, P169
[5]
[Anonymous], IBM DB2 DAT LIN
[6]
[Anonymous], P 4 INT WORKSH DAT M
[7]
CHAUDHURI S, 1999, IEEE DATA ENG B, V22, P20
[8]
Corien T. H., 2001, INTRO ALGORITHMS
[9]
Dageville B., 2004, P 30 INT C VERY LARG, P1098, DOI DOI 10.1016/B978-012088469-8.50096-6
[10]
Graefe G., 2007, DAMON 07, DOI [10.1145/1363189.1363198, DOI 10.1145/1363189.1363198]