Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~tavi/papers/sssj.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: duke.edu/~tavi/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we examine the spatial join problem. In particular, we focus on the case when neither of the inputs is indexed. We present a new algorithm, Scalable Sweep-based Spatial Join (SSSJ), that is based on the distribution-sweeping technique recently proposed in computational geometry, and that is the first to achieve theoretically optimal bounds on internal computation time as well as I/O transfers. We present experimental results based on an efficient implementation of the SSSJ... (Update)
Cited by: More
Discovering Co-location Patterns from Spatial Datasets: A.. - Yan Huang Member (Correct)
Closest-Point-of-Approach Join for Moving Object Histories - Subramanian Arumugam.. (Correct)
Scalable Spatio-temporal Continuous Query.. - Xiong, Mokbel.. (Correct)
Similar documents (at the sentence level):
31.3%: Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
11.0%: I/O-Efficient Join Algorithms for Temporal, Spatial, and.. - Ramaswamy, Suel (1996) (Correct)
Active bibliography (related documents): More All
0.6: Selectivity Estimation in Spatial Databases - Acharya, Poosala, Ramaswamy (1999) (Correct)
0.4: A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000) (Correct)
0.3: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
Similar documents based on text: More All
0.5: A Framework for Index Bulk Loading and Dynamization - Agarwal, Arge, Procopiuc.. (2001) (Correct)
0.5: Implementing I/O-Efficient Data Structures Using TPIE - Arge, Procopiuc, Vitter (2002) (Correct)
Related documents from co-citation: More All
44: Partition Based SpatialMerge Join - Patel, DeWitt - 1996
35: Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
31: Spatial Hash-Joins - Lo, Ravishankar - 1996
BibTeX entry: (Update)
L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J. S. Vitter. Scalable sweeping-based spatial join. In Proc. IEEE International Conf. on Very Large Databases, 1998. http://citeseer.ist.psu.edu/article/arge98scalable.html More
@inproceedings{ arge98scalable,
author = "Lars A. Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jeffrey Scott Vitter",
title = "Scalable Sweeping-Based Spatial Join",
booktitle = "Proc. 24th Int. Conf. Very Large Data Bases, {VLDB}",
month = "24--27~",
pages = "570--581",
year = "1998",
url = "citeseer.ist.psu.edu/article/arge98scalable.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
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
516 tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
233 tree: A dynamic index for multi-dimensional objects - Sellis, Roussopoulos et al. - 1987
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
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
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
134 Spatial query processing in an object-oriented database syst.. (context) - Orenstein - 1986
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
115 Partition based spatial-merge join - Patel, DeWitt - 1996
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
106 Priority search trees (context) - McCreight - 1985
81 Spatial hash-joins - Lo, Ravishankar - 1996
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
76 PROBE spatial data modeling and query processing in an image.. (context) - Orenstein, Manola - 1988
68 Spatial joins using seeded trees (context) - Lo, Ravishankar - 1994
61 AlphaSort: A RISC machine sort (context) - Nyberg, Barclay et al. - 1994
55 Spatial joins using R-trees: Breadth-first traversal with gl.. - Huang, Jing et al. - 1997
55 High-performance sorting on networks of workstations (context) - Arpaci-Dusseau, Arpaci-Dusseau et al. - 1997
54 Spatial join indices (context) - Rotem - 1991
53 Efficient computation of spatial joins - Gunther - 1993
49 Size separation spatial join - Koudas, Sevcik - 1997
46 Rule-based optimization and query processing in an extensibl.. (context) - Becker, Guting - 1992
41 A comparison of spatial query processing techniques for nati.. (context) - Orenstein - 1990
37 Algorithms for Klee's rectangle problems (context) - Bentley - 1977
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1996
31 ACM Transactions on Database Systems (context) - Valduriez - 1987
30 A qualitative comparison study of data structures for large .. - Hoel, Samet - 1992
29 A new algorithm for computing joins with grid files (context) - Becker, Hinrichs et al. - 1993
26 efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
25 The montage extensible datablade architecture (context) - Ubell - 1994
24 Generating seeded trees from data sets (context) - Lo, Ravishankar - 1995
23 A super scalar sort algorithm for RISC processors - Agarwal - 1996
19 Theory and practice of I/O-efficient algorithms for multidim.. - Arge, Procopiuc et al. - 1998
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
18 A transparent parallel I/O environment (context) - Vengroff - 1994
14 A practical divide-and-conquer algorithm for the rectangle i.. (context) - Guting, Schilling - 1987
10 Understanding GIS---the ARC/INFO method (context) - INFO - 1993
9 The interval skip list: A data structure for finding all int.. - Hanson - 1991
7 technical documentation (context) - line, tm - 1992
4 with subsequent revisions (context) - Vengroff, Manual et al. - 1995
4 http://www.intergraph.com/iss/products/mge/mge-7.0.htm (context) - Corp - 1997
3 ACM Special Interest Group on Management of Data (context) - Orenstein, spatial et al. - 1989
1 Advanced battlefield processing (context) - Emmerman - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~tavi/research.html): More
Randomization in On-line Algorithms - Procopiuc (1998) (Correct)
A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000) (Correct)
Data Structures for Spatial Database Systems - Procopiuc (1997) (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