Advertisement

A Cost Model for an Adaptive Cell-Based Index Structure

  • Wonik Choi
  • Jinseok Chae
  • Nam-Joong Kim
  • Mee Young Sung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4263)

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%.

Keywords

Cost Model Index Structure Ubiquitous Computing Range Query Point Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CML04]
    Choi, W., Moon, B., Lee, S.: Adaptive cell-based index for moving objects. Data & Knowledge Engineering 48(1), 75–101 (2004)CrossRefGoogle Scholar
  2. [FK94]
    Faloutsos, C., Kamel, I.: Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension. In: Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis, Minnesota, May 1994, pp. 4–13 (1994)Google Scholar
  3. [FSR87]
    Faloutsos, C., Sellis, T.K., Roussopoulos, N.: Analysis of Object Oriented Spatial Access Methods. In: Proceedings of the 1987 ACM SIGMOD International Conference on Management of Data, San Francisco, California, May 1987, pp. 426–439 (1987)Google Scholar
  4. [KF93]
    Kamel, I., Faloutsos, C.: On Packing R-trees. In: Bhargava, B.K., Finin, T.W., Yesha, Y. (eds.) Proceedings of the Second International Conference on Information and Knowledge Management, Washington, DC, November 1993, pp. 490–499 (1993)Google Scholar
  5. [KTF98]
    Kumar, A., Tsotras, V.J., Faloutsos, C.: Designing access methods for bitemporal databases. IEEE Transactions on Knowledge and Data Engineering 10(1), 1–20 (1998)CrossRefGoogle Scholar
  6. [NS98]
    Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proceedings of the 1998 ACM Symposium on Applied Computing, Atlanta, Georgia, February 1998, pp. 235–240 (1998)Google Scholar
  7. [PSTW93]
    Pagel, B.-U., Six, H.-W., Toben, H., Widmayer, P.: Towards an Analysis of Range Query Performance in Spatial Data Structures. In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington, DC, May 1993, pp. 214–221 (1993)Google Scholar
  8. [SAC+79]
    Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access Path Selection in a Relational Database Management System. In: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, Massachusetts, May 1979, pp. 23–34 (1979)Google Scholar
  9. [SRF87]
    Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R + -Tree: A Dynamic Index for Multi-Dimensional Objects. In: VLDB 1987, Proceedings of 13th International Conference on Very Large Data Bases, Brighton, England, September 1987, pp. 507–518 (1987)Google Scholar
  10. [TP01]
    Tao, Y., Papadias, D.: MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval queries. In: Proceedings of 27th Int’l. Conf. on Very Large Data Bases, September 2001, Roma, Italy (2001)Google Scholar
  11. [TPZ02]
    Tao, Y., Papadias, D., Zhang, J.: Cost models for overlapping and multiversion structures. ACM Transactions on Database Systems 27(3), 299–342 (2002)CrossRefGoogle Scholar
  12. [TS96]
    Theodoridis, Y., Sellis, T.K.: A Model for the Prediction of R-tree Performance. In: Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Montreal, Canada, June 1996, pp. 161–171 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wonik Choi
    • 1
  • Jinseok Chae
    • 2
  • Nam-Joong Kim
    • 2
  • Mee Young Sung
    • 2
  1. 1.School of Information and Communication EngineeringInha UniversityIncheonKorea
  2. 2.Department of Computer Science and EngineeringUniversity of IncheonIncheonKorea

Personalised recommendations