I/O-Efficient Algorithms for Problems on Grid-based Terrains (Extended Abstract) (2000)
Cached
Download Links
- [www.cs.duke.edu]
- [www.cs.duke.edu]
- [www.cs.unm.edu]
- [www.cs.duke.edu]
- [www.cs.duke.edu]
- [faculty.cse.tamu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. Workshop on Algorithm Engineering and Experimentation |
| Citations: | 28 - 13 self |
BibTeX
@INPROCEEDINGS{Arge00i/o-efficientalgorithms,
author = {Lars Arge and Laura Toma and Jeffrey Scott Vitter},
title = {I/O-Efficient Algorithms for Problems on Grid-based Terrains (Extended Abstract)},
booktitle = {In Proc. Workshop on Algorithm Engineering and Experimentation},
year = {2000},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Lars Arge Laura Toma Jeffrey Scott Vitter Center for Geometric Computing Department of Computer Science Duke University Durham, NC 27708--0129 Abstract The potential and use of Geographic Information Systems (GIS) is rapidly increasing due to the increasing availability of massive amounts of geospatial data from projects like NASA's Mission to Planet Earth. However, the use of these massive datasets also exposes scalability problems with existing GIS algorithms. These scalability problems are mainly due to the fact that most GIS algorithms have been designed to minimize internal computation time, while I/O communication often is the bottleneck when processing massive amounts of data.
