Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~large/Papers/seek.ps.Z poly.edu/suel/papers/edbt.ps duke.edu/~jsv/Pape...kSpatialJoin.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/~large/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Most spatial join algorithms either assume the existence of a spatial index structure that is traversed during the join process, or solve the problem by sorting, partitioning, or on-the-fly index construction. In this paper, we develop a simple plane-sweeping algorithm that unifies the index-based and non-index based approaches. This algorithm processes indexed as well as non-indexed inputs, extends naturally to multi-way joins, and can be built easily from a few standard operations. We ... (Update)
Context of citations to this paper: More
...while [10] proposes a breath first synchronized R tree join algorithm. 8] proposed join algorithms based on Generalization Trees. [2] developed a plane sweeping algorithm that unifies the index based and non index based approaches. The plane sweeping phase of the algorithm...
...proposed by Beckmann et al. 10] their variant is called the R tree) and various bulk loading procedures. More details are given in [6, 7]. Logarithmic method. The logarithmic method [16] is a generic dynamization method. Given a static index with certain properties, it...
Cited by: More
R-Trees Have Grown Everywhere - Manolopoulos, Nanopoulos.. (Correct)
An Experimental Performance Evaluation of.. - Jeong, Paton.. (2004) (Correct)
Slot Index Spatial Join - Nikos Mamoulis And (Correct)
Similar documents (at the sentence level):
21.0%: A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000) (Correct)
Active bibliography (related documents): More All
0.5: Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
0.4: Partition Based Spatial-Merge Join - Patel, DeWitt (1996) (Correct)
0.3: The Sort/Sweep Algorithm: A New Method for R-tree Based.. - Gurret, Rigaux (Correct)
Similar documents based on text: More All
0.6: Implementing I/O-Efficient Data Structures Using TPIE - Arge, Procopiuc, Vitter (2002) (Correct)
0.5: Theory and Practice of I/O-Efficient Algorithms.. - Arge, Procopiuc.. (1998) (Correct)
Related documents from co-citation: More All
8: An asymptotically optimal multiversion b-tree - Becker, Gschwind et al. - 1996
8: Designing Access Methods for Bitemporal Databases (context) - Kumar, Tsotras et al. - 1997
7: A Comparison of Access methods for Time Evolving Data (context) - Salzberg, Tsotras - 1994
BibTeX entry: (Update)
L. Arge, O. Procopiuc, S. Ramaswamy,T.Suel,J.Vahrenhold, and J. Vitter. A unified approach for indexed and non-indexed spatial join. Proc. 7th Intl. Conf. Extending Databases Technology, LNCS 1777, 413--429. 2000. http://citeseer.ist.psu.edu/arge00unified.html More
@article{ arge00unified,
author = "Lars Arge and Octavian Procopiuc and Sridhar Ramaswamy and Torsten Suel and Jan Vahrenhold and Jeffrey Scott Vitter",
title = "A Unified Approach for Indexed and Non-indexed Spatial Joins",
journal = "Lecture Notes in Computer Science",
volume = "1777",
pages = "413--??",
year = "2000",
url = "citeseer.ist.psu.edu/arge00unified.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1988
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1990
516 tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
233 tree: A dynamic index for multidimensional objects - Sellis, Roussopoulos et al. - 1987
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
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
115 Partition based spatial-merge join - Patel, DeWitt - 1996
81 Spatial hash-joins - Lo, Ravishankar - 1996
77 Client-server Paradise - DeWitt, Kabra et al. - 1994
76 PROBE spatial data modeling and query processing in an image.. (context) - Orenstein, Manola - 1988
70 UNIX Internals: The New Frontiers (context) - Vahalia - 1996
68 Spatial joins using seeded trees (context) - Lo, Ravishankar - 1994
61 Scalable sweeping-based spatial join - Arge, Procopiuc et al. - 1998
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
56 STL Tutorial and Reference Guide: C++ Programming with the S.. (context) - Musser, Saini - 1996
55 Spatial joins using R-trees: Breadth-first traversal with gl.. - Huang, Jing 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 - 1996
47 Selectivity estimation in spatial databases - Acharya, Poosala et al. - 1999
41 A comparison of spatial query processing techniquesfor nativ.. (context) - Orenstein - 1990
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
24 Processing and optimization of multiway spatial joins using .. - Mamoulis, Papadias et al. - 1999
24 Generating seeded trees from data sets (context) - Lo, Ravishankar - 1995
24 on Database Systems (context) - Valduriez, ACM - 1987
19 Theory and practice of I/Oefficient algorithms for multidime.. - Arge, Procopiuc et al. - 1998
14 A practical divide-and conquer algorithm for the rectangle i.. (context) - Guting, Schilling - 1987
14 Worst-case efficient external-memory priority queues - Brodal, Katajainen - 1998
9 Sibling clustering of tree-based spatial indexes for efficie.. (context) - Kim, Cha - 1998
8 The manual and software distribution are available on the we.. (context) - Arge, Barve et al. - 1999
7 Integration of spatial join algorithms for joining multiple .. - Mamoulis, Papadias - 1999
7 Join strategies on KD-tree indexed relations (context) - Kitsuregawa, Harada et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~large/index.html): 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