论文信息 - AVL-Trees for Localized Search

AVL-Trees for Localized Search

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.

Athanasios K. Tsakalidis | A. Tsakalidis

[1] Leonidas J. Guibas,et al. A new representation for linear lists , 1977, STOC '77.

[2] Robert E. Tarjan,et al. Design and Analysis of a Data Structure for Representing Sorted Lists , 1978, SIAM J. Comput..

[3] Athanasios K. Tsakalidis. Rebalancing Operations for Deletions in AVL-Trees , 1985, RAIRO Theor. Informatics Appl..

[4] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[5] Heikki Mannila,et al. Measures of Presortedness and Optimal Sorting Algorithms , 1985, IEEE Transactions on Computers.

[6] C. C. Foster. Information retrieval: information storage and retrieval using AVL trees , 1965, ACM '65.

[7] Kurt Mehlhorn. Sorting Presorted Files , 1979, Theoretical Computer Science.

[8] Kurt Mehlhorn,et al. An Amortized Analysis of Insertions into AVL-Trees , 1986, SIAM J. Comput..

[9] S. Rao Kosaraju,et al. Localized search in sorted lists , 1981, STOC '81.

[10] Kurt Mehlhorn,et al. On the Average Number of Rebalancing Operations in Weight-Balanced Trees , 1980, Theor. Comput. Sci..