External Memory Data Structures (2001)

Cached

Download Links

by Lars Arge
Citations:81 - 36 self

Documents Related by Co-Citation

546 The input/output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
320 External Memory Algorithms and Data Structures – Jeffrey Scott Vitter - 1998
255 Organization and maintenance of large ordered indexes – R Bayer, E McCreight - 1972
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
556 The ubiquitous B-tree – Douglas Comer - 1979
73 A Locality-Preserving Cache-Oblivious Dynamic Dictionary – Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu - 2002
135 Cache-oblivious B-trees – Michael A. Bender, Erik D. Demaine, Martin Farach-colton - 2000
77 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) – Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter - 1999
43 Cache oblivious distribution sweeping – Gerth Stølting Brodal, Rolf Fagerberg - 2002
64 Cache Oblivious Search Trees via Binary Trees of Small Height – Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Rolf Fagerberg Riko Jacob - 2002
32 Optimised predecessor data structures for internal memory – Naila Rahman, Richard Cole, Rajeev Raman - 2001
97 A new data structure for representing sorted lists – S Huddleston, K Mehlhorn - 1982
151 The buffer tree: A new technique for optimal I/O-algorithms – Lars Arge - 1995
561 Multidimensional Access Methods – Volker Gaede, Oliver Günther - 1998
20 Exponential structures for cache-oblivious algorithms – M Bender, R Cole, R Raman - 2001
32 Scanning and traversing: maintaining data for traversals in a memory hierarchy – Michael A. Bender, Richard Cole, Erik D. Demaine - 2002
380 The K-D-B Tree: A Search Structure for Large Multidimensional Indexes – J Robinson - 1981
79 Cache-Oblivious Algorithms – Harald Prokop - 1999
1108 Multidimensional binary search trees used for associative searching – J L Bentley - 1975