A cost model for an adaptive cell-based index structure

Authors:
Wonik Choi;Jinseok Chae;Nam-Joong Kim;Mee Young Sung
Affiliations:
School of Information and Communication Engineering, Inha University, Incheon, Korea;Department of Computer Science and Engineering, University of Incheon, Incheon, Korea;Department of Computer Science and Engineering, University of Incheon, Incheon, Korea;Department of Computer Science and Engineering, University of Incheon, Incheon, Korea
Venue:
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Year:
2006

Citing 12
Cited 0

Analysis of object oriented spatial access methods

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Towards an analysis of range query performance in spatial data structures

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A model for the prediction of R-tree performance

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards historical R-trees

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Cost models for overlapping and multiversion structures

ACM Transactions on Database Systems (TODS)
Access path selection in a relational database management system

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Designing Access Methods for Bitemporal Databases

IEEE Transactions on Knowledge and Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

Proceedings of the 27th International Conference on Very Large Data Bases
Adaptive cell-based index for moving objects

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a cost model for an adaptive cell-based index structure which aims at efficient management of immense amounts of spatio-temporal data. We first survey various methods to estimate the performance of R-tree variants. Then, we present our cost model which accurately estimates the number of disk accesses for the adaptive cell-based index structure. To show the accuracy of our model, we perform a detailed analysis using various data sets. The experimental result shows that our model has the average error ratio from 7% to 13%.