(Enter summary)
Abstract: We consider the problem of parallelizing highdimensional
proximity joins. We present
a parallel multidimensional join algorithm
based on an the epsilon-kdB tree and compare
it with the more common approach of space
partitioning. An evaluation of the algorithms
on an IBM SP2 shared-nothing multiprocessor
is presented using both synthetic and real-life
datasets. We also examine the effectiveness
of the algorithms in the context of a specific
data-mining problem, that of finding similar... (Update)
Context of citations to this paper: More
...with the same dataset. A detailed description of these performance considerations and how they impact the implementation can be found in [19]. 3.3 Parallel Space Partitioning For comparison purposes, we have also implemented a parallel space partitioning algorithm for...
.... [1, 7, 8, 19, 21, 22] A generalization of this is within, where the objects are required to lie within some distance of each other [24, 29]. Other spatial predicates have been considered as well, and general methods to computea spatial join proposed [4, 14] Some of these...
Cited by: More
Database Support for Multimedia Applications - Ortega-Binderberger, al. (2001)
(Correct)
An Efficient Parallel Algorithm for High Dimensional.. - Alsabti, Ranka, Singh (1997)
(Correct)
Incremental Distance Join Algorithms for Spatial Databases - Hjaltason, Samet (1998)
(Correct)
Active bibliography (related documents): More All
0.5: PHANTOM: Parallelization of Hierarchical Applications usiNg.. - Goil (1996)
(Correct)
0.5: Parallel Classification on SMP Systems - Zaki, Ho, Agrawal (1998)
(Correct)
0.1: Integration of Spatial Join Algorithms for Joining Multiple.. - Mamoulis, Papadias (1998)
(Correct)
Similar documents based on text: More All
0.1: High-dimensional Similarity Joins - Kaist (1997)
(Correct)
0.1: Mining Association Rules with Item Constraints - Srikant, Vu, Agrawal
(Correct)
0.1: The Quest Data Mining System - Agrawal, Mehta, Shafer, Srikant.. (1996)
(Correct)
Related documents from co-citation: More All
3: An Efficient Parallel Algorithm for High Dimensional Similarity Join
- Alsabti, Ranka et al. - 1997
3: Fast similarity search in the presence of noise (context) - Agrawal, Lin et al. - 1995
3: Efficient processing of spatial joins using R-trees (context) - Brinkhoff, Kriegel et al. - 1993
BibTeX entry: (Update)
J. C. Shafer and R. Agrawal. Parallel Algorithms for High-dimensional Proximity Joins. Research Report, IBM Almaden Research Center, San Jose, California, 1997. Available from http://www.almaden.ibm.com/cs/quest. http://citeseer.ist.psu.edu/shafer97parallel.html More
@inproceedings{ shafer97parallel,
author = "John C. Shafer and Rakesh Agrawal",
title = "Parallel Algorithms for High-dimensional Proximity Joins",
pages = "176--185",
year = "1997",
url = "citeseer.ist.psu.edu/shafer97parallel.html" }
Citations (may not include all citations):
241
Fast subsequence matching in time-series databases
- Faloutsos, Ranganathan et al. - 1994
205
Efficient similarity search in sequence databases
- Agrawal, Faloutsos et al. - 1993
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
126
Fast similarity search in the presence of noise (context) - Agrawal, Lin et al. - 1995
118
Linear clustering of objects with multiple attributes (context) - Jagadish - 1990
115
Partition Based SpatialMerge Join
- Patel, DeWitt - 1996
89
The Gamma database machine project
- DeWitt, Ghandeharizadeh et al. - 1990
86
MPI: A Message-Passing Interface Standard
- Forum - 1994
81
A class of data structures for associative searching (context) - Orenstein, Merrett - 1984
81
Spatial Hash-Joins
- Lo, Ravishankar - 1996
49
Size separation spatial join
- Koudas, Sevcik - 1997
33
Analysis of the clustering properties of hilbert spacefillin..
- Moon, Jagadish et al. - 1996
27
Multiattribute hashing using gray codes (context) - Faloutsos - 1992
25
Highdimensional similarity joins
- Shim, Srikant et al. - 1997
24
Parallel processing of spatial joins using R-Trees (context) - Brinkhoff, Kriegel et al. - 1996
24
Generating seeded trees from data sets (context) - Lo, Ravishankar - 1995
5
Parallel Algorithms for High-dimensional Proximity Joins
- Shafer, Agrawal - 1997
2
Algorithms for DataParallel spatial operations (context) - Hoel, Samet - 1994
2
Scalable POWERparallel Systems (context) - Machines - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.almaden.ibm.com/cs/people/ragrawal/pubs.html): More
Mining Sequential Patterns: Generalizations And Performance.. - Srikant, Agrawal (1996)
(Correct)
On the Computation of Multidimensional Aggregates - Agarwal, Agrawal.. (1996)
(Correct)
SPRINT: A Scalable Parallel Classifier for Data Mining - Shafer, Agrawal, Mehta (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