Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
PREPRINT. International Journal of Computer Matehmathics, 38:3748, 1990. Maintaining ffbalanced Trees by Partial Rebuilding
 

Summary: PREPRINT. International Journal of Computer Matehmathics, 38:37­48, 1990.
Maintaining ff­balanced Trees by Partial Rebuilding
Arne Andersson \Lambda
Department of Computer Science
Lund University
Box 118
S­221 00 Lund
Sweden
Abstract
The balance criterion defining the class of ff­balanced trees states that
the ratio between the shortest and longest paths from a node to a
leaf be at least ff. We show that a straight­forward use of partial
rebuilding for maintenance of ff­balanced trees requires an amortized
cost of \Omega\Gamma p
n) per update. By slight modifications of the maintenance
algorithms the cost can be reduced to O(log n) for any value of ff,
0 ! ff ! 1.
KEY WORDS ff­balanced trees, partial rebuilding, search trees.
CR CATEGORIES: E.1, F.2, I.1.2.
1 Introduction

  

Source: Andersson, Arne - Department of Information Technology, Uppsala Universitet

 

Collections: Computer Technologies and Information Sciences