ISB-tree: A new indexing scheme with efficient expected behaviour
From MaRDI portal
Publication:616991
DOI10.1016/J.JDA.2010.08.001zbMATH Open1215.68085OpenAlexW2048484740MaRDI QIDQ616991FDOQ616991
Authors: Christos Makris, George Mavritsakis, Spyros Sioutas, Kostas Tsichlas, A. C. Kaporis, Athanasios K. Tsakalidis, Christos Zaroliagis 
Publication date: 20 January 2011
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2010.08.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The string B-tree
- Cache-oblivious algorithms
- Title not available (Why is that?)
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Organization and maintenance of large ordered indexes
- A balanced search tree O(1) worst-case update time
- Efficient locking for concurrent operations on B-trees
- Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- Algorithms for parallel memory, I: Two-level memories
- A constant update time finger search tree
- Bounded disorder: The effect of the index
- The SB-tree: An index-sequential structure for high-performance sequential access
- Dynamic interpolation search
- A simple bounded disorder file organization with good performance
- Deletions That Preserve Randomness
- Title not available (Why is that?)
- Dynamic interpolation search in \(o(\log\log n)\) time
- Title not available (Why is that?)
- Improved bounds for finger search on a RAM
- Algorithms and Computation
Cited In (4)
Uses Software
This page was built for publication: ISB-tree: A new indexing scheme with efficient expected behaviour
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616991)
