Lars Arge  Home/Search
Context
Related
| duke.edu/~large/Papers/newsweep.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/~large/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Lars Arge large@daimi.aau.dk BRICS ?? Department of Computer Science, University of Aarhus, Denmark ??? Abstract. In this paper we develop a technique for transforming an internal memory tree data structure into an external storage structure. We show how the technique can be used to develop a search-tree-like structure, a priority-queue, a (one-dimensional) range-tree and a segment-tree, and give examples of how these structures can be used to develop efficient I/O-algorithms. All ... (Update)
Similar documents (at the sentence level):
27.5%: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
Active bibliography (related documents): More All
1.8: The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation .. - Arge (Correct)
0.5: Locality Optimization for Program Instances - Leopold (Correct)
0.5: The Colored Quadrant Priority Search Tree with an.. - Brinkmann, Graf.. (Correct)
Similar documents based on text: More All
0.5: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.3: I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, Toma, al. (Correct)
0.3: External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
BibTeX entry: (Update)
@misc{ arge-buffer,
author = "Lars Arge",
title = "The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)",
url = "citeseer.ist.psu.edu/245520.html" }
Citations (may not include all citations):48 range Tree: A New Data Structure for Range Searching in Seco.. (context) - Subramanian, Ramaswamy et al. - 1995
28 Vol 3: Sorting and Searching (context) - Knuth, of et al. - 1973
17 Text and Monographs in Computer Science (context) - Preparata, Shamos et al. - 1985
9 Guest Editor's Introduction in IEEE Computer (context) - Yale, Subsystem et al. - 1994
3 Wilkes: An Introduction to Disk Drive Modeling (context) - Ruemmler - 1994
2 Ottmann: Priority Search Trees in Secondary Memory (context) - Icking, Klein - 1987
2 Vitter: External-Memory Algorithms for Processing Line Segme.. (context) - Arge, Vengroff
2 Vitter: External-Memory Graph Algorithms (context) - Chiang, Goodrich et al. - 1995
2 Shriver: Algorithms for Parallel Memory I: Two-Level Memorie.. (context) - Vitter - 1994
2 Vitter: External-Memory Computational Geometry (context) - Goodrich, Tsay et al. - 1993
1 BRICS Report Series RS (context) - Arge, Structures et al. - 1994
1 Mehlhorn: A New Data Structure for Representing Sorted Lists (context) - Huddleston - 1982
1 Vitter: Deterministic Distribution Sort in Shared and Distri.. (context) - Nodine - 1993
1 Subramanian: Path Caching: A Technique for Optimal External .. (context) - Ramaswamy - 1994
1 These Proceedings (context) - Chiang, the et al.
1 Vitter: Indexing for Data Models with Constraints and Classe.. (context) - Kanellakis, Ramaswamy et al. - 1993
1 Wood: An Optimal Worst Case Algorithm for Reporting Intersec.. (context) - Bentley - 1980
1 Larsen: A General Lower Bound on the I/O-Complexity of Compa.. (context) - Arge, Knudsen - 1993
1 thesis University of Amsterdam (context) - Smid, Structures et al. - 1989
Documents on the same site (http://www.cs.duke.edu/~large/index.html): More
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold (1999) (Correct)
I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al. (Correct)
Efficient Searching with Linear Constraints - Agarwal, Arge, Erickson.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC