Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~jsv/Paper...Vit.IO_survey.pdf 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/TPIE/ (more) (Enter author homepages) |
Rate this article:      (best)Updated version from ACM Computing Surveys, June 2001 View Comments (1) |
Abstract: . Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication for I/O between fast internal memory and slower external memory-such as disks-can be a major performance bottleneck. In this paper we survey the state of the art in the design and analysis of external memory algorithms and data structures.We discuss several important paradigms that exploit locality to solve batched and online problems... (Update)
Cited by: More
Improved Data Partitioning for Building Large ROLAP Data.. - Chen, Dehne, Eavis, al. (Correct)
Compact Representations Of Simplicial - Meshes In Two (Correct)
Balance Refinement of Massive Linear Octree Datasets - Tiankai Tu And (Correct)
Similar documents (at the sentence level):
23.7%: External Memory Algorithms and Data Structures - Vitter (1999) (Correct)
10.3%: Online Data Structures in External Memory - Vitter (1999) (Correct)
Active bibliography (related documents): More All
0.5: Forbidden Minors to Graphs with Small Feedback Sets - Dinneen, Cattell, Fellows (1996) (Correct)
0.0: Luby-Racko Backwards: Increasing Security by Making Block.. - Bellare, al. (Correct)
0.0: Automotive Engine Control and Hybrid Systems.. - Balluchi.. (2000) (Correct)
Similar documents based on text: More All
0.5: External Memory Algorithms with Dynamically Changing Memory.. - Barve, Vitter (1998) (Correct)
0.3: Fast Priority Queues for Cached Memory - Sanders (1999) (Correct)
0.2: Compression and Fast Indexing for Multi-Gigabyte Text Databases - Moffat, Zobel (1994) (Correct)
Related documents from co-citation: More All
21: The input-output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
13: External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
12: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
BibTeX entry: (Update)
J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE DATA. Online Version: http://www.cs.duke.edu/~jsv/ , 2000. http://citeseer.ist.psu.edu/vitter01external.html More
@article{ vitter01external,
author = "Jeffrey Scott Vitter",
title = "External memory algorithms and data structures: dealing with massive data",
journal = "ACM Computing Surveys",
volume = "33",
number = "2",
pages = "209--271",
year = "2001",
url = "citeseer.ist.psu.edu/vitter01external.html" }
Citations (may not include all citations):76 New York (context) - the, IEEE et al. - 1999
57 volume 1340 of Lecture Notes in Computer Science (context) - van Kreveld, Nievergelt et al. - 1997
1 Output in Parallel and Distributed Systems (context) - Input - 1996
1 American Mathematical Society Press (context) - Goodman, Pollack et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/TPIE/): More
Theory and Practice of IO-Efficient Algorithms for.. - Arge, al. (Correct)
Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
Online Data Structures in External Memory - Vitter (1999) (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