Skip Navigation

The Computer Journal 1985 28(4):417-425; doi:10.1093/comjnl/28.4.417
© 1985 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zivani, N.
Right arrow Articles by Gonnet, G. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The Analysis of an Improved Symmetric Binary B-tree Algorithm

N. Zivani1 *, H. J. Olivié2 § and G. H. Gonnet3 ¶

1 Departamento de Ciencia da Computacao, UFMG, CP 702, Belo Horizonte, Brazil, 2 Stedelijke Industriele Hogeschool, Paardenmarkt 94, B-2000, Antwerp, Belgium, 3 Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

We present an improved version of the original insertion and deletion algorithm for symmetric binary B-trees. We perform the analysis of the insertion algorithm using a fringe analysis method, and obtain bounds on the expected number of transformations per insertion and on the expected number of balanced nodes. We also examine empirically the expected costs to search, insert, and delete keys in symmetric binary B-trees.


* Departamento de Ciência da Computaça~o, UFMG, CP 702, 30,000 Belo Horizonte, MG, Brazil

§ Stedelijke Industriële Hogeschool, Paardenmarkt 94, B-2000, Antwerp, Belgium

Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L3G1, Canada


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.