Ming-Ling Lo, Chinya V. Ravishankar  Home/Search
Context Related
| ibm.com/scalabledb/p...seededtkde98.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: ibm.com/scalabledb/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Existing methods for spatial joins require pre-existing spatial indices or other pre-computation, but such approaches are inefficient and limited in generality. Operand datasets of spatial joins may not all have pre-computed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, and are not always efficient for joins. This paper explores the design and implementation of seeded... (Update)
Context of citations to this paper: More
...an on the fly construction of a second index, followed by STT, could compete with SAI. This idea has inspired the join algorithm of [LR98] which constructs a seeded tree on the non indexed relation which is a R tree whose first levels match exactly those of the existing R...
.... in the spatial database context, in large I O and CPU costs, due to the repeated evaluation of randomly located window queries [PD96, LR98, MP99, PRS99] Despite this well accepted fact, there are few propositions of alternative strategies. The first one we are aware of is...
Cited by: More
The Sort/Sweep Algorithm: A New Method for R-tree Based.. - Gurret, Rigaux (Correct)
The BASIS System: a Benchmarking Approach for.. - Gurret.. (1999) (Correct)
A Performance Evaluation of Spatial Join Processing.. - Papadopoulos, Rigaux.. (Correct)
Similar documents (at the sentence level):
6.9%: Spatial Hash-Joins - Lo, Ravishankar (1996) (Correct)
Active bibliography (related documents): More All
0.2: High Dimensional Similarity Joins: Algorithms and Performance .. - Koudas, Sevcik (1998) (Correct)
0.2: Partition Based Spatial-Merge Join - Patel, DeWitt (1996) (Correct)
0.2: Applications of Computational Geometry to Geographic.. - De Floriani, Puppo.. (Correct)
Similar documents based on text: More All
0.2: Adaptive and Incremental Processing for Distance Join Queries - Shin, Moon, Lee (2002) (Correct)
0.1: A Seeded Memetic Algorithm for Large Unit Commitment Problems - Valenzuela, Smith (1999) (Correct)
0.1: NO flow-tagging by photodissociation of NO 2 - a new.. - Orlemann, Schulz.. (1999) (Correct)
Related documents from co-citation: More All
4: Benchmarking Spatial Joins A la Carte (context) - Gunther, Oria et al. - 1997
4: STR: A Simple and Efficient Algorithm for R-tree Packing - Leutenegger, Lopez et al. - 1997
4: Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
BibTeX entry: (Update)
M.-L. Lo and C.V. Ravishankar. The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins. IEEE Transactions on Knowledge and Data Engineering, 10(1), 1998. First published in SIGMOD'94. http://citeseer.ist.psu.edu/lo98design.html More
@article{ lo98design,
author = "Ming-Ling Lo and Chinya V. Ravishankar",
title = "The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins",
journal = "Knowledge and Data Engineering",
volume = "10",
number = "1",
pages = "136-152",
year = "1998",
url = "citeseer.ist.psu.edu/lo98design.html" }
Citations (may not include all citations):666 The Design and Analysis of Spatial Data Structures (context) - Samet - 1990
200 R-trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
159 Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
84 The grid file: An adaptable, symmetric multikey file structu.. (context) - Nievergelt, Hinterberger et al. - 1984
68 Spatial joins using seeded trees (context) - Lo, Ravishankar - 1994
63 The R + - tree: A dynamic index for multi-dimensional object.. - Sellis, Roussopoulos et al. - 1987
61 Join indices (context) - Valduriez - 1987
54 Spatial join indices (context) - Rotem - 1991
53 Efficient computation of spatial joins - Gunther - 1993
51 der, and B. Seeger, "The R -tree: An efficient and robust ac.. (context) - Beckmann, Kriegel et al. - 1990
49 Analysis of object oriented spatial access methods (context) - Faloutsos, Sellis et al. - 1987
47 Redundancy in spatial databases (context) - Orenstein - 1989
41 A comparison of spatial query processing techniques for nati.. (context) - Orenstein - 1990
24 Generating seeded trees from data sets (context) - Lo, Ravishankar - 1995
14 A practical divide-andconquer algorithm for the rectangle in.. (context) - Guting, Schilling - 1987
14 Distance-associated join indices for spatial range search (context) - Lu, Han - 1992
11 Sampling from spatial databases (context) - Olken, Rotem - 1993
11 Introduction to statistical analysis (context) - Dixon - 1983
7 Geographic Information Systems (context) - Star, Estes - 1990
4 An algorithm for computing the overlay of k-dimensional spac.. (context) - Orenstein - 1991
Documents on the same site (http://www.research.ibm.com/scalabledb/pubs.html): More
C++ Objects in DB2 - Reinwald, Lehman, Pirahesh.. (1996) (Correct)
Constructing Transaction Serialization Order for Incremental.. - Lo, Hsiao (1997) (Correct)
Spatial Hash-Joins - Lo, Ravishankar (1996) (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