The Community for Technology Leaders
Proceedings 18th International Conference on Data Engineering (2002)
San Jose, California
Feb. 26, 2002 to Mar. 1, 2002
ISBN: 0-7695-1531-2
pp: 0697
Gang Luo , University of Wisconsin-Madison
Jeffrey F. Naughton , University of Wisconsin-Madison
Curt J. Ellmann , NCR Advance Development Lab
ABSTRACT
Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non-blocking. This investigation has yielded a number of algorithms, including the symmetric hash join, the XJoin, the Ripple Join, and their variants. However, to our knowledge no one has proposed a non-blocking spatial join algorithm. In this paper, we propose a parallel non-blocking spatial join algorithm that uses duplicate avoidance rather than duplicate elimination. Results from a prototype implementation in a commercial parallel object-relational DBMS show that it generates answer tuples steadily even in the presence of memory overflow, and that its rate of producing answer tuples scales with the number of processors. Also, when allowed to run to completion, its performance is comparable with the state-of-the-art blocking parallel spatial join algorithm.
INDEX TERMS
non-blocking, parallel spatial join algorithm
CITATION
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, "A Non-Blocking Parallel Spatial Join Algorithm", Proceedings 18th International Conference on Data Engineering, vol. 00, no. , pp. 0697, 2002, doi:10.1109/ICDE.2002.994786
82 ms
(Ver 3.3 (11022016))