Advertisement

AVL-trees for localized search

  • Athanasios K. Tsakalidis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Abstract

We present a data structure based on AVL-trees which allows to perform an insertion or a deletion in time O(log d) where'd is the distance of the position searched for from the finger which points to the end of the file. Moving a finger 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.

Keywords

Search Path Good Node Height Decrease Basic Data Structure Double Rotation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ADELSON-VELSKII, G.M. LANDIS, "An Algorithm for the organisation of information" (in Russian), Dokl.Ak.Nauk SSSR Vol. 146, p. 263–266 (1962)Google Scholar
  2. [2]
    N. BLUM and K. MEHLHORN, "On the average number of rebalancing operations in weight-balanced trees" TCS 11, p. 303–320 (1980)Google Scholar
  3. [3]
    M. BROWN and R. TARJAN, "Design and analysis of a data structure for representing sorted lists", SIAM J. Computing Vol 9, p. 594–614 (1980)Google Scholar
  4. [4]
    C.C. FOSTER, "Information storage and retrieval using AVL-trees" ACM 20th National Conference, p. 192–205 (1965)Google Scholar
  5. [5]
    L. GUIBAS, E. MC. CREIGHT, M. PLASS, J. ROBERTS, "A new representation of linear lists" 9th STOC, p. 49–60 (1977)Google Scholar
  6. [6]
    Sc. HUDDLESTON, "An efficient scheme for fast local updates in linear lists", University of California at Irvine (1981)Google Scholar
  7. [7]
    S. HUDDLESTON and K. MEHLHORN, "A new data structure for representing sorted lists" Acta Informatica 17, p. 157–184 (1982)Google Scholar
  8. [8]
    D. KNUTH, "The art of computer programming", Vol 3, Sorting and Searching. Addison Wesley Reading Mass. (1973)Google Scholar
  9. [9]
    S.R. KOSARAJU, "Localized search in sorted lists" 14 STOC, p. 62–69 (1981)Google Scholar
  10. [10]
    K. MEHLHORN, "Sorting presorted files", 4th GI-Conference on Theoretical Computer Science, Aachen LNCS Vol. 67, p. 199–219 (1979)Google Scholar
  11. [11]
    K. MEHLHORN and A. TSAKALIDIS, "AVL-trees, refined analysis and application to sorting presorted files", Technischer Bericht A82/05, FB 10 Universität des Saarlandes (1982)Google Scholar
  12. [12]
    R.E. TARJAN, private communicationGoogle Scholar
  13. [13]
    A. TSAKALIDIS, "AVL-trees for localized Search", Technischer Bericht A 83/13, FB 10, Universität des Saarlandes (1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Athanasios K. Tsakalidis
    • 1
  1. 1.FB 10, InformatikUniversität des SaarlandesSaarbrückenWest Germany

Personalised recommendations