A study on deciding reoganization points for data bases with quadratic search cost function

2차 탐색비용함수를 갖는 데이터베이스의 재구성 시기결정에 관한 연구

Reorganization is essential part of data base maintenanc work and the reasonable reorganization points can be determined from the trade-off between reorganization cost and performance degradation. There has been many reorganization models so far, but none of these models have assumed nonlinear search cost function. This paper presents the existensions of two existing linear reorganization models for the case where the search cost function is quadratic. The higher performance of these extended models was shown in quadratic search cost function case.