Adaptive multi-stage distance join processing
Authors:
Open Access
- 16 May 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 29 (2) , 343-354
Abstract
A spatial distance join is a relatively new type of operation introduced for spatial and multimedia database applications. Additional requirements for ranking and stopping cardinality are often combined with the spatial distance join in on-line query processing or internet search environments. These requirements pose new challenges as well as opportunities for more efficient processing of spatial distance join queries. In this paper, we first present an efficient k -distance join algorithm that uses spatial indexes such as R-trees. Bi-directional node expansion and plane-sweeping techniques are used for fast pruning of distant pairs, and the plane-sweeping is further optimized by novel strategies for selecting a sweeping axis and direction. Furthermore, we propose adaptive multi-stage algorithms for k -distance join and incremental distance join operations. Our performance study shows that the proposed adaptive multi-stage algorithms outperform previous work by up to an order of magnitude for both k -distance join and incremental distance join queries, under various operational conditions.Keywords
This publication has 13 references indexed in Scilit:
- Incremental distance join algorithms for spatial databases1998
- On saying “Enough already!” in SQL1997
- Partition based spatial-merge join1996
- Spatial hash-joins1996
- Nearest neighbor queries1995
- Accounting for boundary effects in nearest neighbor searching1995
- Spatial joins using seeded trees1994
- Multi-step processing of spatial joins1994
- Efficient processing of spatial joins using R-trees1993
- R-trees1984