ISB-tree: a new indexing scheme with efficient expected behaviour

  • Authors:

  • Alexis Kaporis;Christos Makris;George Mavritsakis;Spyros Sioutas;Athanasios Tsakalidis;Kostas Tsichlas;Christos Zaroliagis

  • Affiliations:

  • Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;,Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;Dept of Computer Eng and Informatics, University of Patras, Patras, Greece;,Dept of Computer Eng and Informatics, University of Patras, Patras, Greece

  • Venue:
  • ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the interpolation search tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O(1) worst-case (w.c.) block transfers and search operations in O(logB log n) expected block transfers, where B represents the disk block size and n denotes the number of stored elements. The expected search bound holds with high probability for a large class of (unknown) input distributions. The w.c. search bound of our indexing scheme is O(logBn) block transfers. Our update and expected search bounds constitute a considerable improvement over the O(logBn) w.c. block transfer bounds for search and update operations achieved by the B-tree and its numerous variants. This is also suggested by a set of preliminary experiments we have carried out. Our indexing scheme is based on an externalization of a main memory data structure based on interpolation search.