ISB-tree: A new indexing scheme with efficient expected behaviour
type: Item
instance of: scholarly article
title: ISB-tree: A new indexing scheme with efficient expected behaviour
zbMATH Open document ID: 1215.68085
author: Christos Makris
author: George Mavritsakis
author: Spyros Sioutas
author: Kostas Tsichlas
author: A. C. Kaporis
author: Athanasios K. Tsakalidis
author: Christos Zaroliagis
published in: Journal of Discrete Algorithms
publication date: 2011-01-20T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5839382
zbMATH Keywords: B-tree
zbMATH Keywords: external memory data structure
zbMATH Keywords: interpolation search
zbMATH Keywords: data indexing
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: j.jda.2010.08.001
OpenAlex ID: W2048484740
cites work: Q4252266
cites work: Dynamic interpolation search in o(log log n) time
cites work: Bounded disorder: The effect of the index
cites work: Organization and maintenance of large ordered indexes
cites work: Q3853109
cites work: A constant update time finger search tree
cites work: The string B-tree
cites work: Cache-Oblivious Algorithms
cites work: Algorithms - ESA 2003
cites work: Algorithms and Computation
cites work: Q4369384
cites work: Deletions That Preserve Randomness
cites work: Efficient locking for concurrent operations on B-trees
cites work: A balanced search tree O(1) worst-case update time
cites work: A simple bounded disorder file organization with good performance
cites work: Q4937698
cites work: Q4702188
cites work: Dynamic interpolation search
cites work: The SB-tree: An index-sequential structure for high-performance sequential access
cites work: Worst-case optimal insertion and deletion methods for decomposable searching problems
cites work: Algorithms for parallel memory, I: Two-level memories
cites work: Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
DOI: 10.1016/J.JDA.2010.08.001
description: scientific article; zbMATH DE number 5839382