Priority search trees in secondary memory (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 314 LNCS, Issue , 1988, Pages 84-93

  Icking, Ch ^a   Klein, R ^a   Ottmann, Th ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

B tree; Priority search tree; Red black tree; Search trees; Secondary memory

Indexed keywords

GRAPH THEORY;

B TREES; EXTENDED ABSTRACTS; LONGEST PATH; OPTIMAL SOLUTIONS; RED BLACK TREE; SEARCH TREES; SECONDARY MEMORY;

TREES (MATHEMATICS);

EID: 85034626057     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-19422-3_7     Document Type: Conference Paper

References (13)

1. R. Bayer, Symmetrie Binary B-trees: Data Structure and Maintenance Algorithms, Acta Informatica, 1 (1972), pp. 290-306.
2. R. Bayer, E. McCreight, Organization of Large Ordered Indexes, Acta Informatica, 1 (1972), pp. 173-189.
3. H. Edelsbrunner, Geometries and Algorithmics - A Tutorial in Computational Geometry, Bulletin of the EATCS, 32 (1987), pp. 118-142.
4. L. J. Guibas, R. Sedgewick, A Dichromatic Framework for Balanced trees, 19th Annual IEEE Symposium, on Foundations of Computer Science, 1978, pp. 8-21.
5. K. Hinrichs, The Grid File System: Implementation and Case Studies of Applications, Dissertation at the Swiss Federal Institute of Technology Zürich, ETH Zürich, 1985.
6. R. Klein, O. Nurmi, Th. Ottmann, D. Wood, Optimal Dynamic Solutions for Fixed Windowing Problems, Proceedings of the 2nd Annual Symposium on Computational Geometry, 1986, pp. 109-115, (to appear in Algorithmica).
7. E. M. McCreight, Priority Search Trees, SIAM J. Comput., 14 (1985), pp. 257-276.
8. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.
9. K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, EATCS Monographs on Theoretical Computer Science, Springer- Verlag. 1984.
10. J. Nievergelt, H. Hinterberger, K. C. Sevcik, The Grid File: An Adaptable Symmetric Multikey File Structure, ACM Transactions on Data Base Systems, 9(1) (1984), pp. 38- 71.
11. H. J. Olivié, A New Class of Balanced Trees: Half Balanced Binary Search Trees, RAIRO Informatique Théorique, 16 (1982), pp. 51-71.
12. Th. Ottmann, H.-W. Six, Eine neue Klasse von ausgeglichenen Binärbäumen, Angewandte Informatik, 9 (1976), pp. 395-400.
13. R. E. Tarjan, Updating a Balanced Search Tree in 0(1) Rotations, Information Processing Letters, 16 (1983), pp. 253-257.