Lars Arge  Home/Search
Context Related
| duke.edu/~large/Papers/esa.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: duke.edu/~large/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in data structures on external storage devices, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major performance bottleneck. In this paper we survey recent advances in the development of worst-case I/O-efficient external memory... (Update)
Cited by: More
Compact Representations Of Simplicial - Meshes In Two (Correct)
Incremental Constructions con BRIO - Amenta, Choi, Rote (2003) (Correct)
Space efficiency in Synopsis construction algorithms - Guha (2005) (Correct)
Similar documents (at the sentence level):
51.9%: External Memory Data Structures - Lars Ar Ge (Correct)
Active bibliography (related documents): More All
1.3: Implementing I/O-Efficient Data Structures Using TPIE - Arge, Procopiuc, Vitter (2002) (Correct)
1.3: Validity Information Retrieval for Spatio-Temporal.. - Tao, Mamoulis, Papadias (2003) (Correct)
1.2: On External-Memory MST, SSSP and Multi-way Planar Graph.. - Arge, Brodal, al. (2000) (Correct)
Similar documents based on text: More All
0.7: On Two-Dimensional Indexability and Optimal Range Search.. - Arge, al. (1999) (Correct)
0.0: Verification of Switch-Level Designs with Many-Valued Logic - Hähnle, Kernig (1993) (Correct)
0.0: Comparing Predator-Prey Models Qualitatively and Quantitatively.. - Jost (1998) (Correct)
Related documents from co-citation: More All
24: The input-output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
17: Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
10: Two-dimensional indexability and optimal range search indexing - Arge, Samoladas et al. - 1999
BibTeX entry: (Update)
L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets. Kluwer Academic Publishers, 2000. (To appear). http://citeseer.ist.psu.edu/arge00external.html More
@article{ arge01external,
author = "Lars Arge",
title = "External Memory Data Structures",
journal = "Lecture Notes in Computer Science",
volume = "2161",
pages = "1--??",
year = "2001",
url = "citeseer.ist.psu.edu/arge00external.html" }
Citations (may not include all citations):765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
516 tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
375 LEDA: A Platform for Combinatorial and Geometric Computing - Mehlhorn, Naher - 2000 ACM DBLP
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1994 ACM DBLP
262 Multidimensional access methods - Gaede, Gunther - 1998 ACM DBLP
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
233 tree: A dynamic index for multi-dimensional objects - Sellis, Roussopoulos et al. - 1987
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1990
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972 ACM DBLP
193 Nearest neighbor queries - Roussopoulos, Kelley et al. - 1995 ACM DBLP
165 The SR-tree: An index structure for high-dimensional nearest.. - Katayama, Satoh - 1997
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
134 Spatial query processing in an object-oriented database syst.. (context) - Orenstein - 1986
133 Geometric range searching and its relatives - Agarwal, Erickson - 1999
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1981
129 Making data structures persistent (context) - Driscoll, Sarnak et al. - 1989 ACM DBLP
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
121 Data structures for mobile data - Basch, Guibas et al. - 1999
116 Planar point location using persistent search trees (context) - Sarnak, Tarjan - 1986
109 InputOutput complexity sorting and related problem (context) - Vitter, Output et al. - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
106 Indexing the positions of continuously moving objects - Saltenis, Jensen et al. - 2000 ACM DBLP
106 A decomposition of multidimensional point sets with applicat.. - Callahan, Kosaraju - 1995 DBLP
106 Priority search trees (context) - McCreight - 1985 DBLP
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1996 ACM DBLP
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
90 Direct spatial search on pictorial databases using packed R-.. (context) - Roussopoulos, Leifker - 1985 ACM DBLP
88 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990 ACM DBLP
88 An asymptotically optimal multiversion B-tree - Becker, Gschwind et al. - 1996 ACM DBLP
87 A comparison of access methods for time evolving data (context) - Salzberg, Tsotras - 1999
83 tree using fractals (context) - Kamel, Faloutsos et al. - 1994
80 On indexing mobile objects - Kollios, Gunopulos et al. - 1999 ACM DBLP
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
78 PATRICIA: Practical algorithm to retrieve information coded .. (context) - Morrison - 1968
77 Client-server paradise - DeWitt, Kabra et al. - 1994 ACM DBLP
72 Efficient partition trees (context) - Matousek - 1992 ACM DBLP
69 Filtering search: a new approach to query-answering (context) - Chazelle - 1986
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 Indexing moving points - Agarwal, Arge et al. - 2000 ACM DBLP
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
61 Scalable sweeping-based spatial join - Arge, Procopiuc et al. - 1998 ACM DBLP
60 The power of geometric duality (context) - Chazelle, Guibas et al. - 1985 ACM DBLP
59 A functional approach to data structures and its use in mult.. (context) - Chazelle - 1988 DBLP
56 Updating and querying databases that track mobile units - Wolfson, Sistla et al. - 1999 ACM DBLP
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. - 1995
49 Dynamic fractional cascading (context) - Mehlhorn, Naher - 1990 DBLP
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
46 Decomposable searching problems (context) - Bentley - 1979 DBLP
43 STR: A simple and efficient algorithm for R-tree packing - Leutenegger, L'opez et al. - 1996 ACM DBLP
41 A comparison of spatial query processing techniques for nati.. (context) - Orenstein - 1990
41 Blocking for external graph searching - Nodine, Goodrich et al. - 1996 ACM DBLP
40 Improved algorithms and data structures for solving graph pr.. - Kumar, Schwabe - 1996 ACM
38 An implementation and performance analysis of spatial data a.. (context) - Greene - 1989 ACM DBLP
37 External memory algorithms and data structures - Vitter - 1999 ACM DBLP
37 the analysis of indexing schemes - Hellerstein, Koutsoupias et al. - 1997
36 Lower bounds for orthogonal range searching (context) - Chazelle - 1990
35 Cache-oblivious B-trees - Bender, Demaine et al. - 2000
35 optimal isosurface extraction (context) - Chiang, Silva - 1997
35 The design of the cell tree: An object-oriented index struct.. (context) - Gunther - 1989 DBLP
33 Binary search tree of bounded balance (context) - Nievergelt, Reingold - 1973
33 A functional approach to external graph algorithms - Abello, Buchsbaum et al. - 1998 ACM DBLP
33 External memory data structures - Arge - 2001 ACM DBLP
33 The buddy-tree: An efficient and robust access method for sp.. (context) - Seeger, Kriegel - 1990
33 Interactive out-of-core isosurface extraction - Chiang, Silva et al. - 1998 ACM DBLP
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1996
30 On two-dimensional indexability and optimal range search ind.. - Arge, Samoladas et al. - 1999
30 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
29 Fast nearest neighbor search in high-dimensional spaces - Berchtold, Ertl et al. - 1998
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985 DBLP
29 Dynamic point location in general subdivisions (context) - Baumgarten, Jung et al. - 1994
28 Improving the query performance of high-dimensional index st.. - Berchtold, Bohm et al. - 1998
27 Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997
26 complexity of graph algorithm (context) - Munagala, Ranade et al. - 1999
26 efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
25 Novel approaches to the indexing of moving objects trajector.. - Pfoser, Jensen et al. - 2000
25 Efficient searching with linear constraints - Agarwal, Arge et al. - 2000 ACM DBLP
25 Algorithms for dynamic closest-pair and n-body potential fie.. - Callahan, Kosaraju - 1995
24 New results on dynamic planar point location (context) - Cheng, Janardan - 1992 ACM 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
22 range searching in external memory (context) - Vengroff, Vitter et al. - 1996
20 Efficient cross-tree for external memory - Grossi, Italiano - 1999
20 Priority search trees in secondary memory (context) - Icking, Klein et al. - 1987 ACM
19 A generic approach to bulk loading multidimensional index st.. (context) - van den Bercken, Seeger et al. - 1997
19 Fast priority queues for cached memory - Sanders - 1999
19 Space-filling curves and their use in the design of geometri.. - Asano, Ranjan et al. - 1997 ACM DBLP
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1990
18 A comparative analysis of some two-dimensional orderings (context) - Abel, Mark - 1990
18 Efficient Algorithms for Computational Geometry and Graph Pr.. (context) - Chiang, O- - 1995
16 Memory paging for connectivity and path problems in graphs - Feuerstein, Marchetti-Spaccamela - 1993
16 trees and their applications (context) - Callahan, Goodrich et al. - 1995
16 the equivalence of some rectangle problems (context) - Edelsbrunner, Overmars - 1982
15 Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis et al. - 1991
15 Fast string searching in secondary storage: Theoretical deve.. (context) - Ferragina, Grossi - 1996 DBLP
14 Efficient bulk operations on dynamic R-trees - Arge, Hinrichs et al. - 1999 ACM DBLP
14 Randomized external-memory algorithms for some geometric pro.. - Crauser, Ferragina et al. - 1998 ACM DBLP
14 XP-trees---External priority search trees (context) - Blankenagel, Guting - 1990
14 Worst-case efficient external-memory priority queues - Brodal, Katajainen - 1998
14 Efficient computation of temporal aggregates with range pred.. - Zhang, Markowetz et al. - 2001 ACM DBLP
14 The grid file system: Implementation and case studies of app.. (context) - Hinrichs - 1985
13 On sorting strings in external memory - Arge, Ferragina et al. - 1997
13 An external-memory data structure for shortest path queries - Hutchinson, Maheshwari et al. - 1999
13 On external memory graph traversal - Buchsbaum, Goldwasser et al. - 2000 ACM DBLP
13 Optimal dynamic range searching in nonreplicating index stru.. - Kanth, Singh - 1999
12 A unified approach for indexed and non-indexed spatial joins - Arge, Procopiuc et al. - 1999 ACM DBLP
11 IEEE Transactions on Knowledge and Data Engineering (context) - Varman, Verma et al. - 1997
11 Online data structures in external memory - Vitter - 1999
11 External memory algorithms for outerplanar graphs (context) - Maheshwari, Zeh - 1999 ACM DBLP
10 Box-trees and R-trees with near-optimal query time - Agarwal, de Berg et al. - 2001 ACM DBLP
10 Point location (context) - Snoeyink - 1997 ACM
9 A framework for index bulk loading and dynamization - Agarwal, Arge et al. - 2001 ACM DBLP
9 Overcoming the memory bottleneck in suffix tree construction (context) - Farach, Ferragina et al. - 1998 ACM DBLP
8 An experimental study of priority queues in external memory - Brengel, Crauser et al. - 1999 ACM DBLP
8 A transparent parallel I/O environment (context) - Vengroff - 1994
8 sets and fast halfplane search on paged memory (context) - Franciosa, Talamo et al. - 1994
8 halfspace range reporting (context) - Chan - 2000
8 External memory techniques for isosurface extraction in scie.. - Chiang, Silva - 1999
8 manual and software distribution are available web httpwww (context) - Procopiuc, Vengroff et al. - 1999
8 Tight bounds for 2-dimensional indexing schemes - Koutsoupias, Taylor - 1998
7 efficient dynamic planar point location (context) - Arge, Vahrenhold et al. - 2000
7 SSSP and multiway planar graph separation (context) - Arge, Brodal et al. - 2000
7 A lower bound theorem for indexing schemes and its applicati.. - Samoladas, Miranker - 1998 ACM DBLP
7 External memory bfs on undirected graphs with bounded degree - Meyer - 2001 ACM DBLP
6 efficient algorithms for problems on grid-based terrains (context) - Arge, Toma et al. - 2000
6 Early experiences in implementing the buffer tree - Hutchinson, Maheshwari et al. - 1997
6 Time optimal halfplane search on external memory (context) - Franciosa, Talamo - 1997
6 On external-memory planar depth first search - Arge, Meyer et al. - 2001 ACM DBLP
6 efficient dynamic point location in monotone planar subdivis.. (context) - Agarwal, Arge et al. - 1999
5 The hb -tree: A multi-attribute index supporting concurrency (context) - Evangelidis, Lomet et al. - 1997
5 Efficient splitting and merging algorithms for order decompo.. - Grossi, Italiano - 1999 ACM DBLP
5 efficient algorithms for graphs of bounded treewidth (context) - Maheshwari, Zeh et al. - 2001
5 trees with low stabbing number (context) - de Berg, Gudmundsson et al. - 2000
4 Flow computation on massive grids (context) - Arge, Chase et al. ACM DBLP
4 Planar point-location for large data sets: To seek or not to.. - Vahrenhold, Hinrichs - 2000
4 A time responsive indexing scheme for moving points - Agarwal, Arge et al. - 2001
3 CRB-tree: An optimal indexing scheme for 2d aggregate querie.. (context) - Agarwal, Arge et al. - 2001
3 Theory and practice of I/O-efficient algorithms for multidim.. - Arge, Procopiuc et al. - 1998 ACM
2 LEDA-SM: A Platform for Secondary Memory Computation - Crauser, Mehlhorn - 1999
2 On constructing suffix arrays in external memory (context) - Crauser, Ferragina - 1999 ACM DBLP
2 Theoretical Computer Science (context) - Fadel, Jakobsen et al. - 1999 ACM
2 Dynamic dictionary matching in external memory (context) - Ferragina, Luccio - 1998 ACM DBLP
2 efficient wellseparated pair decomposition and its applicati.. (context) - Govindarajan, Lukovszki et al. - 2000
2 LEDA-SM: Extending LEDA to secondary memory (context) - Crauser, Mehlhorn - 1999
2 Oefficient algorithms for contour line extraction and planar.. - Agarwal, Arge et al. - 1998
1 A structure for dynamically maintaining rooted trees (context) - Frederickson - 1993
1 An optimal algorithm for closets pair maintenance (context) - Bespamyatnikh - 1998
1 efficient planar separators and applications (context) - Zeh, O- - 2001
1 Dynamic kd-trees on large data sets (context) - Agarwal, Arge et al. - 2001
1 A generic approach to processing non-equijoins (context) - van den Bercken, Seeger et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~large/): More
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge (Correct)
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold (1999) (Correct)
I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al. (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