Database Paper Browser

Back to papers

Parallel Algorithms for High-dimensional Proximity Joins

Summary: Proposes a parallel multidimensional proximity-join using the epsilon-kdB tree, with empirical comparison to space-partitioning approaches. Demonstrates scalable performance on a shared-nothing IBM SP2, handles data skew, and applies to time-series similarity mining. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8419
Venue
VLDB
Year
1997
Pagerank
4.8226178e-05
Overall Rank
7,113 | 50.57%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,605 Incremental Distance Join Algorithms for Spatial Databases 1998 SIGMOD 0.00011180126
6,502 Similarity Join over Array Data 2016 SIGMOD 5.0288901e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
65 Fast Subsequence Matching in Time-Series Databases 1994 SIGMOD 0.00061977022
147 Efficient Processing of Spatial Joins Using R-trees 1993 SIGMOD 0.00041201518
217 A Class of Data Structures for Associative Searching 1984 PODS 0.00033533621
290 Linear Clustering of Objects with Multiple Attributes 1990 SIGMOD 0.00028845557
362 Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases 1995 VLDB 0.00025758421
923 Partition Based Spatial-Merge Join 1996 SIGMOD 0.00015254021
1,174 Spatial Hash-Joins 1996 SIGMOD 0.00013490827
3,462 Size Separation Spatial Join 1997 SIGMOD 7.0683581e-05
Previous Page 1 / 1 Next

Semantically Similar Papers