Advertisement

On the complexity of BV-tree updates

  • Michael Freeston
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1191)

Abstract

We have shown in this paper how logarithmic exact-match access and update complexity can be maintained in a BV-tree representation. The price paid for guaranteed dynamic performance (i.e. performance which does not degrade over time for a given data set) is that the demotion of entries which no longer represent guards may be postponed. In the worst case this could require a substantial increase in the size of higher level index nodes in order to maintain a constant level of performance for a given data set.

However, although we have as yet no clear idea how the probability of occurrence of the worst case might be theoretically assessed, it intuitively seems to be an inconceivably improbable event. It is also difficult to see how particular data distributions, or the order of insertion or deletion could significantly affect this probability. Experimental performance studies are needed to establish this intuition more solidly. Most importantly, however, the index implementor can choose to guarantee a constant performance level by accommodating increased page sizes when necessary, or accept the remote but unpredictable risk of lower performance within a simpler implementation of fixed page size.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Fre87]
    Freeston, M. The BANG file: a new kind of grid file. ACM SIGMOD Conf., San Francisco, May 1987.Google Scholar
  2. [Fre89]
    Freeston, M. Advances in the Design of the BANG File. 3rd International Conference on Foundations of Data Organisation and Algorithm, Paris, June 1989.Google Scholar
  3. [Fre95a]
    Freeston, M. A General Solution of the n-dimensional B-tree Problem. ACM SIGMOD Conf., San Jose, CA, May 1995.Google Scholar
  4. [Fre95b]
    Freeston, M. The Application of Multi-Dimensional Indexing Methods to Constraints. ESPRIT WG CONTESSA Workshop, Friedrichshafen, Germany, September 1995.Google Scholar
  5. [KSS+89]
    Kriegel, H.-P., Schiwietz, M., Schneider, R. and Seeger, B. A Performance Comparison of Multidimensional Point and Spatial Access Methods. 1st Symposium on the Design of Large Spatial Databases, Santa Barbara CA, 1989. [Lecture Notes in Computer Science No. 409, Springer-Verlag, 1990].Google Scholar
  6. [LS89]
    Lomet, D. and Salzberg, B. The hB-tree: a Robust Multi-Attribute Indexing Method. ACM Trans. on Database Systems, Vol.15, No.4, 1989.Google Scholar
  7. [Ora96]
    Oracle Corporation Spatial Data Option. White paper, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Michael Freeston
    • 1
  1. 1.CCSE/AlexandriaUniversity of CaliforniaSanta Barbara

Personalised recommendations