Lars Arge  Home/Search
Context Related
| duke.edu/~large/Papers/gisnotes.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: uci.edu/~eppstein/gina/gina.ff (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this note we survey the recent developments in external-memory algorithms with applications in GIS. First we discuss the Aggarwal-Vitter I/O-model and illustrate why normal internal-memory algorithms for... (Update)
Context of citations to this paper: More
.... operations (insertions and deletions) o line in 19 such a way that the amortized complexity of each operation is O( 1 B logM B N B ) [4]. As a result the running time of the algorithm in external memory becomes O( N B logM B N B ) I O s. Note that the above proof works...
.... perform operations (insertions and deletions) off line in such a way that the amortized complexity of each operation is O( 1 B logM B N B ) [4]. As a result the running time of the algorithm in external memory becomes O( N B logM B N B ) I O s. Note that the above proof works...
Cited by: More
Extending LEDA to Secondary Memory - Andreas Crauser And (1999) (Correct)
Indexing Problems in Spatiotemporal Databases - Kollios (2000) (Correct)
On the performance of LEDA-SM - Crauser, Mehlhorn, Althaus, Brengel, .. (1997) (Correct)
Similar documents (at the sentence level):
20.1%: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
Active bibliography (related documents): More All
1.6: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1998) (Correct)
1.3: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
0.8: External Memory Data Structures - Arge (2000) (Correct)
Similar documents based on text: More All
0.7: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.6: Reducing I/O Complexity by Simulating Coarse.. - Dehne, Dittrich.. (1999) (Correct)
0.6: External-Memory Algorithms for Processing Line Segments.. - Arge, al. (1995) (Correct)
Related documents from co-citation: More All
12: Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
10: The Buffer Tree: A New Technique for Optimal I/O-Algorithms (context) - Arge - 1995
10: Efficient External-Memory Data Structures and Applications - Arge - 1996
BibTeX entry: (Update)
L. Arge. External-memory algorithms with applications in geographic information systems. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, editors, Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340, 1997. http://citeseer.ist.psu.edu/article/arge97externalmemory.html More
@incollection{ arge97externalmemory,
author = "Lars Arge",
title = "External-memory algorithms with applications in {GIS}",
booktitle = "Algorithmic foundations of geographic information systems",
volume = "1340",
publisher = "Springer-Verlag",
editor = "Marc van Kreveld and Jurg Nievergelt and Thomas Roos and Peter Widmayer",
pages = "213--254",
year = "1997",
url = "citeseer.ist.psu.edu/article/arge97externalmemory.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
2003 The Art of Computer Programming (context) - Knuth - 1973
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994 ACM DBLP
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985 ACM DBLP
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972 ACM DBLP
174 Time bounds for selection (context) - Blum, Floyd et al. - 1973 DBLP
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
114 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1992 ACM DBLP
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
110 Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1996 ACM DBLP
99 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990 ACM
91 Computational Geometry -- Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
82 Hierarchical memory with block transfer (context) - Aggarwal, Chandra et al. - 1987 DBLP
82 A model for hierarchical memory (context) - Aggarwal, Alpern et al. - 1987
80 Amortized computational complexity (context) - Tarjan - 1985
68 An efficient algorithm for determining the convex hull of a .. (context) - Graham - 1972 DBLP
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982 ACM DBLP
67 A data structuring technique (context) - Chazelle, Guibas - 1986
64 The ultimate planar convex hull algorithm (context) - Kirkpatrick, Seidel - 1986 ACM
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996 ACM
60 The uniform memory hierarchy model of computation - Alpern, Carter et al. - 1994 ACM DBLP
60 Algorithms for bichromatic linesegment problems and polyhedr.. (context) - Chazelle, Edelsbrunner et al. - 1994
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993 ACM DBLP
57 Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1996 ACM DBLP
54 complexity: The red-blue pebble game (context) - Hong, Kung - 1981
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994 ACM DBLP
50 External-memory algorithms for processing line segments in g.. - Arge, Vengroff et al.
49 Virtual Memory for Data Parallel Computing (context) - Cormen - 1992 ACM
48 Triangulating simple polygons and equivalent problems (context) - Fournier, Montuno - 1984 ACM DBLP
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
42 Efficient External-Memory Data Structures and Applications - Arge - 1996
42 Sun Microsystems Inc (context) - Cockcroft, Tuning et al. - 1995
41 Blocking for external graph searching - Goodrich, Nodine et al. - 1996 ACM DBLP
40 Improved algorithms and data structures for solving graph pr.. - Kumar, Schwabe - 1996 ACM
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Wisniewski - 1993 ACM DBLP
37 Algorithms for klee's rectangle problems (context) - Bentley - 1977
35 Permuting information in idealized two-level storage (context) - Floyd - 1972
33 Fast permuting in disk arrays (context) - Cormen - 1993
33 An introduction through randomized algorithms (context) - Mulmuley - 1994
33 A simple randomized parallel algorithm for list-ranking (context) - Anderson, Miller - 1990 ACM DBLP
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1996
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985 DBLP
27 Reporting and counting intersections between two sets of lin.. (context) - Mairson, Stolfi - 1988
27 Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997 DBLP
26 efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
25 An optimal worst case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980 DBLP
24 complexity of ordered binary-decision diagram manipulation (context) - Arge, O- - 1995
23 A fully-dynamic data structure for external substring search (context) - Ferragina, Grossi - 1995 ACM
23 Large-scale sorting in uniform memory hierarchies - Vitter, Nodine - 1993 ACM DBLP
22 range searching in external memory (context) - Vengroff, Vitter et al. - 1996
21 Exploiting extensible dbms in integrated geographic informat.. (context) - Haas, Cody - 1991 ACM DBLP
21 Optimal parallel sorting in multi-level storage - Aggarwal, Plaxton - 1994 ACM DBLP
20 Priority search trees in secondary memory (context) - Icking, Klein et al. - 1987 ACM
19 Theory and practice of I/Oefficient algorithms for multidime.. - Arge, Procopiuc et al. - 1998
19 high-reliability storage subsystems (context) - Ganger, Worthington et al. - 1994
19 A simple trapezoid sweep algorithm for reporting red/blue se.. - Chan - 1994 DBLP
18 Efficient Algorithms for Computational Geometry and Graph Pr.. (context) - Chiang, O- - 1995
18 Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
18 A transparent parallel I/O environment (context) - Vengroff - 1994
17 An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
16 trees and their applications (context) - Callahan, Goodrich et al. - 1995
16 Efficient suffix trees on secondary storage (context) - Clark, Munro - 1996 ACM
16 Counting and reporting red/blue segment intersections - Palazzi, Snoeyink - 1993 ACM DBLP
15 Fast string searching in secondary storage: Theoretical deve.. (context) - Ferragina, Grossi - 1996 DBLP
15 Further comparisons of algorithms for geometric intersection.. - Andrews, Snoeyink et al. - 1994
15 The TWA reservation system (context) - Gifford, Spector - 1984 ACM DBLP
15 Greed sort: An optimal sorting algorithm for multiple disks (context) - Nodine, Vitter - 1995
14 XP-trees---External priority search trees (context) - Blankenagel, Guting - 1990
14 On showing lower bounds for external-memory computational ge.. - Arge, Miltersen
13 On sorting strings in external memory - Arge, Ferragina et al. - 1997
13 A general lower bound on the I/O-complexity of comparison-ba.. (context) - Arge, Knudsen et al. - 1993 ACM DBLP
13 Further computational geometry in secondary memory (context) - Zhu - 1994 ACM DBLP
12 Rectilinear line segment intersection (context) - Vaishnavi, Wood - 1982
12 Virtual memory algorithms (context) - Aggarwal, Chandra - 1988
12 efficient algorithms for contour line extraction and planar .. (context) - Agarwal, Arge et al. - 1998
11 Efficient memory access in large-scale computation (context) - Vitter - 1991 DBLP
10 Understanding GIS---the ARC/INFO method (context) - INFO - 1993
9 Guest Editor's Introduction in IEEE Computer (context) - Patt, candidate et al. - 1994
9 II: Hierarchical multilevel memories (context) - Vitter, Shriver et al. - 1994
9 sets representation and fast halfplane searching (context) - Franciosa, Talamo et al. - 1994
9 efficient scientific computation in TPIE (context) - Vengroff, Vitter et al. - 1995
8 The parallel hierarchical memory model - Juurlink, Wijshoff - 1993 ACM DBLP
6 Dynamic Data Structures on Multiple Storage Media (context) - Smid - 1989
6 Geographic information systems (context) - van Kreveld - 1995 ACM DBLP
5 Available via WWW at http://www (context) - Vengroff, Manual et al. - 1995
5 Maintaining range trees in secundary memory (context) - Overmars, Smid et al. - 1990
5 Maintaining range trees in secundary memory (context) - Smid, Overmars - 1990
4 complexity of comparison and permutation problems (context) - Knudsen, Larsen et al. - 1992
4 Space-time tradeoffs in memory hierarchies - Savage - 1993 ACM
3 Private communication (context) - Vengroff - 1995
1 Master student project (context) - Knudsen, Larsen et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~eppstein/gina/gina.ff): More
Chaining Multiple-Alignment Fragments in Sub-Quadratic Time - Miller (1995) (Correct)
Dealing with Higher Dimensions: The Well-Separated Pair.. - Paul B. Callahan (1995) (Correct)
Generating Automatically-Tuned Bitmaps from Outlines - Hobby (1993) (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