ISB-tree: A new indexing scheme with efficient expected behaviour-Reference-Cited by-同舟云学术

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

Published:2010-12 Issue:4 Volume:8 Page:373-387
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

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

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference37 articles.

1. P.K. Agarwal, L. Arge, G. Brodal, J.S. Vitter, I/O-efficient dynamic point location in monotone planar subdivisions, in: Proc. 10th ACM–SIAM Symp. on Discrete Algorithms – SODA'99, 1999, pp. 11–20.

2. The input/output complexity of sorting and related problems;Aggarwal;Commun. ACM,1988

3. Dynamic interpolation search in o(loglogn) time;Andersson,1993

4. L. Arge, J.S. Vitter, Optimal dynamic interval management in external memory, in: Proc. 37th IEEE Symp. on Foundations of Computer Science – FOCS'96, 1996, pp. 560–569.

5. Bounded disorder: The effects of the index;Baeza-Yates;Theoret. Comput. Sci.,1996

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Analysis and Comparison of Binary and Interpolation Search Algorithms in a B-tree;25th Pan-Hellenic Conference on Informatics;2021-11-26

2. Fully persistent B-trees;Theoretical Computer Science;2020-11

3. Improved Dynamic Graph Coloring;ACM Transactions on Algorithms;2020-06-26

4. HB+tree;Proceedings of the 30th Annual ACM Symposium on Applied Computing;2015-04-13

5. Access Methods;Computing Handbook, Third Edition;2014-05