AVL-trees for localized search

We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates th...

Full description

Saved in:
Bibliographic Details
Published inInformation and control Vol. 67; no. 1; pp. 173 - 194
Main Author Tsakalidis, Athanasios K.
Format Journal Article
LanguageEnglish
Published New York, NY Elsevier B.V 01.10.1985
Academic Press
Subjects
Applied sciences
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
Memory organisation. Data processing
Software
Tree(graph)
Priority
Finger
Deletion
Insertion
Information retrieval
Data structure
Algorithm
Queue
Online AccessGet full text

Cover

More Information
Summary:We present a data structure based on AVL-trees which allows an insertion or a deletion to be performed in time O(log d), where d is the distance of the position searched for from a finger which points to the end of the file. Moving a finger to a distance d costs O(log d). This result demonstrates the power of the oldest basic data structure, the AVL-tree. A special case of interest is an efficient implementation of searchable priority queues such that Deletemin requires only constant time.
ISSN:0019-9958
1878-2981
DOI:10.1016/S0019-9958(85)80034-6