Back to Search Start Over

Fringe Analysis Revisited.

Authors :
Baeza-Yates, Ricardo A.
Source :
ACM Computing Surveys. Mar95, Vol. 27 Issue 1, p109-119. 11p.
Publication Year :
1995

Abstract

Fringe analysis is a technique used to study the average behavior of search trees. In this paper we survey the main results regarding this technique, and we improve a previous asymptotic theorem. At the same time, we present new developments and applications of the theory that allow improvements in several bounds on the behavior of search trees. Our examples cover binary search trees, AVL-trees, 2-3 trees, and B-trees. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*DATA structures
*ELECTRONIC data processing
*COMPUTER programming
*DATABASE management
*SEARCH engines
*ELECTRONIC information resource searching
*COMPUTER science

Details

Language :
English
ISSN :
03600300
Volume :
27
Issue :
1
Database :
Academic Search Index
Journal :
ACM Computing Surveys
Publication Type :
Academic Journal
Accession number :
12726275
Full Text :
https://doi.org/10.1145/214037.214103
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details