Priority search trees in secondary memory (extended abstract)-Reference-Cited by-同舟云学术

Priority search trees in secondary memory (extended abstract)

Published:1988 Issue: Volume: Page:84-93
ISSN:0302-9743
Container-title:Graph-Theoretic Concepts in Computer Science
language:
Short-container-title:

Author:

Icking Ch.,Klein R.,Ottmann Th.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-19422-3_7.pdf

Reference13 articles.

1. R. Bayer, Symmetric 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, Geometrics 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.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Valid-Time Indexing;Encyclopedia of Database Systems;2018

2. Valid-Time Indexing;Encyclopedia of Database Systems;2016

3. Valid-Time Indexing;Encyclopedia of Database Systems;2009

4. Validity Information Retrieval for Spatio-Temporal Queries: Theoretical Performance Bounds;Advances in Spatial and Temporal Databases;2003

5. Single and Bulk Updates in Stratified Trees: An Amortized andWorst-Case Analysis;Lecture Notes in Computer Science;2003