The buffer tree: A new technique for optimal I/O-algorithms-Reference-Cited by-同舟云学术

The buffer tree: A new technique for optimal I/O-algorithms

Published:1995 Issue: Volume: Page:334-345
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Arge Lars

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60220-8_74

Reference22 articles.

1. A. Aggarwal, J.S. Vitter: The I/O Complexity of Sorting and Related Problems. In Proc. of 14th ICALP (1987), LNCS 267, 467–478, and: The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, Vol 31 (9) (1988), 1116–1127.

2. L. Arge: External-Storage Data Structures for Plane-Sweep Algorithms. BRICS Report Series RS-94-16, University of Aarhus, June 1994.

3. L. Arge, M. Knudsen, K. Larsen: A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. In Proc. of 3rd WADS (1993), LNCS 709, 83–94.

4. L. Arge, D.E. Vengroff, J.S. Vitter: External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. Manuscript.

5. J.L. Bentley, D. Wood: An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles. IEEE Transactions on Computers 29 (1980), 571–577.

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

1. GraphZeppelin : How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive);ACM Transactions on Database Systems;2024-05-16

2. GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams;Proceedings of the 2022 International Conference on Management of Data;2022-06-10

3. I/O-Optimal Cache-Oblivious Sparse Matrix-Sparse Matrix Multiplication;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05

4. Adiar Binary Decision Diagrams in External Memory;Tools and Algorithms for the Construction and Analysis of Systems;2022

5. B-Tree Versus Buffer Tree: A Review of I/O Efficient Algorithms;Algorithms for Intelligent Systems;2021