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

by Lars Arge
Venue:University of Aarhus
Citations:150 - 27 self

Documents Related by Co-Citation

546 The input/output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
236 Algorithms for Parallel Memory I: Two-Level Memories – Jeffrey Scott Vitter, Elizabeth A.M. Shriver - 1992
175 External-Memory Graph Algorithms – Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter - 1995
121 External-Memory Computational Geometry – Michael T. Goodrich, Jyh-Jong Tsay, National Chung Cheng, J. Vitter, Darren Erik Vengroff, Jeffrey Scott Vitter - 1993
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
76 External-Memory Algorithms for Processing Line Segments in Geographic Information Systems – Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter - 2007
59 External memory algorithms – J Vitter - 1998
34 I/O-Efficient Scientific Computation Using TPIE – Darren Erik Vengroff, Jeffrey Scott Vitter - 1995
68 I/O-Complexity of Graph Algorithms – Kameshwar Munagala, Abhiram Ranade - 1999
56 Algorithms for Klee’s rectangle problems – J L Bentley
27 External-Memory Algorithms with Applications in Geographic Information Systems – Lars Arge - 1997
320 External Memory Algorithms and Data Structures – Jeffrey Scott Vitter - 1998
162 An asymptotically optimal multiversion B-tree – Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, Peter Widmayer - 1996
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
26 Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep – Yi-Jen Chiang - 1995
22 Theory and Practice of IO-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract) – Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel , Jeffrey Scott Vitter
452 An introduction to disk drive modeling – Chris Ruemmler, John Wilkes - 1994
2201 R-trees: A Dynamic Index Structure for Spatial Searching – Antonin Guttman - 1984
976 The R*-tree: an efficient and robust access method for points and rectangles – Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - 1990