TPR*-트리의 성능 분석에 관한 연구

초록

The TPR*-tree is the most widely-used index structure for effectively predicting the future positions of moving objects. The TPR*-tree, however, has the problem that both of the dead space in a bounding region and the overlap among bounding regions become larger as the prediction time in the future gets farther. This makes more nodes within the TPR*-tree accessed in query processing time, which incurs the performance degradation. In this paper, we examine the performance problem quantitatively with a series of experiments. First, we show how the performance deteriorates as a prediction time gets farther, and also show how the updates of positions of moving objects alleviates this problem. Our contribution would help provide important clues to devise strategies improving the performance of TPR*-trees further.

키워드