| Budget Amount *help |
¥12,200,000 (Direct Cost: ¥12,200,000)
Fiscal Year 1998: ¥3,800,000 (Direct Cost: ¥3,800,000)
Fiscal Year 1997: ¥8,400,000 (Direct Cost: ¥8,400,000)
|
|---|
| Research Abstract |
In this research, we consider a very large secondary storage system configuration which consists of multiple disk arrays connected by appropriate network, that is, an arrayed disk-array system.
At the first year, We have already proposed novel disk array architecture, such as virtual striping, hot block clustering and hot mirroring and developed a fine disk array simulator based on these techniques. Since the applications which require a very large secondary storage system, the arrayed disk-array, process a large amount of data, we took large transaction processing as a target application of our arrayed disk-array and retrieve trace data of TPC-C running on commercial RDB.Then, we estimate the performance of our system analyzing the trace data.
At the second year, we took large data houses as a target application of our system and retrieve trace data of TPC-D running on commercial RDB.We analyzed the access locality of very large dataware houses by using the above trace data. Considering various index mechanisms, especially multicolumn index and its metadata management, we proposed the self-contained performance tuning mechanism based on data characteristics which estimated by applications. Moreover, the prefetch mechanism on the arryaed disk-array by utilizing metadata information was proposed. The performance evaluation of these proposed method was done by analyzing large database applications, such as transaction application (TPC-C) and dataware house application (TPC-D). Consequently, we showed the efficiency of our methods.
|
