Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter  Home/Search
Context Related
| poly.edu/suel/papers/batch.ps duke.edu/~large/Papers/batcheddyn.ps belllabs.com/user/sridh...soda98.ps.gz 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: poly.edu/suel/index (more) From: duke.edu/~cgc/papers (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a powerful framework for designing efficient batch algorithms for certain large-scale dynamic problems that must be solved using external memory. The class of problems we consider, which we call colorable external decomposable problems, include rectangle intersection, orthogonal line segment intersection, range searching, and point location. We are particularly interested in these problems in two and higher dimensions. They have numerous applications in geographic information... (Update)
Context of citations to this paper: More
.... Spatial Join (SSSJ) The algorithm uses several techniques for I O efficient computing recently proposed in computational geometry [APR 98, GTVV93, Arg95, AVV98, Arg97] plus the well known internal memory plane sweeping technique (see, e.g. PS85] It achieves...
...O( N K) B) log M=B N ) I Os. Arge et al. 6] extended the batched result to general subdivisions (see also [15] and Arge et al. [5] to an off line dynamic setting in which a sequence of queries and updates are given in advance and all the queries should be answered as...
Cited by: More
On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen (Correct)
TPIE - User Manual and Reference - Arge, Barve, Hutchinson, Procopiuc.. (1999) (Correct)
Efficient Bulk Operations on Dynamic R-trees (Extended.. - Arge, Hinrichs, al. (Correct)
Similar documents (at the sentence level):
75.0%: Theory and Practice of IO-Efficient Algorithms for.. - Arge, al. (Correct)
Active bibliography (related documents): More All
0.6: External-Memory Algorithms with Applications in Geographic.. - Arge (1997) (Correct)
0.5: I/O-Efficient Join Algorithms for Temporal, Spatial, and.. - Ramaswamy, Suel (1996) (Correct)
0.5: MAXIMUM SIZE OF A DYNAMIC DATA STRUCTURE: Hashing with.. - Aldous, Hofri.. (1992) (Correct)
Similar documents based on text: More All
0.5: A Framework for Index Bulk Loading and Dynamization - Agarwal, Arge, Procopiuc.. (2001) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, al. (1995) (Correct)
0.4: Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
Related documents from co-citation: More All
16: Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
14: External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
10: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
BibTeX entry: (Update)
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Theory and practice of I/Oefficient algorithms for multidimensional batched searching problems. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 685--694, 1998. http://citeseer.ist.psu.edu/arge98theory.html More
@inproceedings{ arge98theory,
author = "Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jeffrey Scott Vitter",
title = "Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract)",
booktitle = "Symposium on Discrete Algorithms",
pages = "685--694",
year = "1998",
url = "citeseer.ist.psu.edu/arge98theory.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
330 Query evaluation techniques for large databases (context) - Graefe - 1993
315 Constraint query languages - Kanellakis, Kuper et al. - 1990
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
182 Skip lists: a probabilistic alternative to balanced trees - Pugh - 1990
159 Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
115 Partition based spatialmerge join - Patel, DeWitt - 1996
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
81 Spatial hash-joins - Lo, Ravishankar - 1996
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
68 Spatial joins using seeded trees (context) - Lo, Ravishankar - 1994
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
53 Efficient computation of spatial joins - Gunther - 1993
50 Externalmemory algorithms for processing line segments in ge.. - Arge, Vengroff et al. - 1998
49 Size separation spatial join - Koudas, Sevcik - 1997
46 Decomposable searching problems (context) - Bentley - 1979
42 Efficient External-Memory Data Structures and Applications - Arge - 1996
40 Improved algorithms and data structures for solving graph pr.. - Kumar, Schwabe - 1996
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1996
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985
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
19 Counting and reporting intersections of d-ranges (context) - Six, Wood - 1982
18 A transparent parallel I/O environment (context) - Vengroff - 1994
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
15 Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis et al. - 1991
14 A practical divide-andconquer algorithm for the rectangle in.. (context) - Guting, Schilling - 1987
13 On sorting strings in external memory - Arge, Ferragina et al. - 1997
12 efficient algorithms for contour line extraction and planar .. (context) - Agarwal, Arge et al. - 1998
5 Available via WWW at http://www (context) - Vengroff, Manual et al. - 1995
5 the intersection of orthogonal objects (context) - Edelsbrunner, Maurer - 1981
4 Journal of Algorithms (context) - McCreight - 1981
3 Cummings Publishing Company Inc (context) - Tanzel, Clifford et al. - 1993
2 Maximum queue size and hashing with lazy deletion (context) - Kenyon, Vitter - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cis.poly.edu/suel/index.htm): More
Highly Portable and Efficient Implementations of Parallel.. - David Blackston (1997) (Correct)
Compact Grid Layouts of Multi-Level Networks - Muthukrishnan, Paterson.. (1999) (Correct)
A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000) (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