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:

  • Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece and Computer Technology Institute, N. Kazantzaki Str, Patras University Campus, 26500 Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece;Department of Informatics, Ionian University, 49100 Corfu, Greece;Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece and Computer Technology Institute, N. Kazantzaki Str, Patras University Campus, 26500 Patras, Greece;Computer Technology Institute, N. Kazantzaki Str, Patras University Campus, 26500 Patras, Greece and Department of Informatics, Aristotle University of Thessaloniki, Greece;Department of Computer Engineering and Informatics, University of Patras, 26500 Patras, Greece and Computer Technology Institute, N. Kazantzaki Str, Patras University Campus, 26500 Patras, Greece

  • Venue:
  • Journal of Discrete Algorithms
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the interpolation search B-tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in O(1) worst-case block transfers and search operations in O(log"Blogn) 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 worst-case search bound of our indexing scheme is O(log"Bn) block transfers. Our update and expected search bounds constitute a considerable improvement over the O(log"Bn) worst-case block transfer bounds for search and update operations achieved by the B-tree and its numerous variants. This is also verified by an accompanying experimental study.