This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Adaptive and Incremental Processing for Distance Join Queries
November/December 2003 (vol. 15 no. 6)
pp. 1561-1578

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 online 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{\hbox{-}}\rm distance join algorithm that uses spatial indexes such as R-trees. Bidirectional 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 multistage algorithms for k{\hbox{-}}{\rm{distance}} join and incremental distance join operations. Our performance study shows that the proposed adaptive multistage algorithms outperform previous work by up to an order of magnitude for both k{\hbox{-}}{\rm{distance}} join and incremental distance join queries, under various operational conditions.

[1] L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J.S. Vitter, “Scalable Sweeping-Based Spatial Join,” Proc. Very Large Data Base Conf., pp. 570-581, Aug. 1998.
[2] S. Arya, D.M. Mount, and O. Narayan, Accounting for Boundary Effects in Nearest Neighbor Searching Proc. 11th Ann. Symp. Computational Geometry, pp. 336-344, 1995.
[3] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[4] A. Belussi and C. Faloutsos, “Estimating the Selectivity of Spatial Queries Using the‘Correlation’Fractal Dimension,” Proc. Very Large Data Bases Conf., pp. 299–310, Sept. 1995.
[5] S. Berchtold, B. Ertl, D.A. Keim, H.-P. Kriegel, and T. Seidl, “Fast Nearest Neighbor Search in High-Dimensional Spaces.,” Proc. Int'l Conf. Data Eng. (ICDE '98), pp. 209–218, Feb. 1998.
[6] S. Berchtold, D. Keim, and H.-P. Kriegel, “The X-Tree: An Index Structure for High-Dimensional Data,” Proc. 22nd Conf. Very Large Data Bases, pp. 28-39, 1996.
[7] T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, “Multi-Step Processing of Spatial Joins,” Proc. ACM SIGMOD Conf. Management of Data, 1994.
[8] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-trees,” Proc. ACM SIGMOD Conf. Management of Data, 1993.
[9] M. Carey and D. Kossmann, “On Saying Enough Already in SQL,” Proc. 1997 ACM-SIGMOD Int'l Conf. Management of Data, pp. 219–230, June 1997.
[10] M. Carey and D. Kossmann, “Reducing the Braking Distance of an SQL Query Engine,” Proc. 24th Int'l Conf. Very Large Data Bases, Aug. 1998.
[11] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, Closest Pair Queries in Spatial Databases Proc. 2000 ACM-SIGMOD Conf., pp. 189-200, May 2000.
[12] D. Donjerkovic and R. Ramakrishnan, Probabilistic Optimization of Top N Queries Proc. 25th Very Large Databases Conf., Sept. 1999.
[13] C. Faloutsos, B. Seeger, A. Traina, and C. Traina Jr, “Spatial Join Selectivity Using Power Laws,” Proc. Special Interest Group on Management of Data (SIGMOD '00), May 2000.
[14] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[15] G.R. Hjaltason and H. Samet, “Ranking in Spatial Databases,” Proc. Fourth Int'l Symp. Large Spatial Databases, pp. 83-95, 1995.
[16] G.R. Hjaltason and H. Samet, Incremental Distance Join Algorithms for Spatial Databases Proc. 1998 ACM-SIGMOD Conf., pp. 237-248, June 1998.
[17] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, “Fast Nearest-Neighbor Search in Medical Image Databases,” Proc. Conf. Very Large Data Bases (VLDB '96), Sept. 1996.
[18] M. Lo and C.V. Ravishankar, “Spatial Joins Using Seeded Trees,” Proc. 1994 ACM SIGMOD Int'l Conf. Management of Data, pp. 209-220, 1994.
[19] M.-L. Lo and C.V. Ravishankar, “Spatial Hash-Joins,” Proc. ACM SIGMOD, pp. 247-258, June 1996.
[20] Bureau of the Census, Tiger/Line Precensus Files: 1997 Technical Documentation, Washington, DC, 1997.
[21] J.A. Orenstein, "A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces," Proc. SIGMOD Int'l Conf. Management Data, pp. 343-352, ACM, 1990.
[22] D. Papadias, N. Mamoulis, and Y. Theodoridis, “Processing and Optimization of Multi-Way Spatial Joins Using R-Trees,” Proc. 18th ACM Symp. Principles of Database Systems (PODS), 1999.
[23] J.M. Patel and D.J. DeWitt, “Partition Based Spatial-Merge Join,” Proc. ACM SIGMOD, pp. 259-270, June 1996.
[24] V. Poosala, “Histogram-Based Estimation Techniques in Databases,” PhD thesis, Univ. of Wisconsin-Madison, 1997.
[25] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[26] R. Pausch, N.R. II Young, and R. DeLine, "SUIT: The Pascal of User Interface Toolkits," ACM Symp. User Interface Software and Technology, Proc. UIST'91, Hilton Head, S.C., pp. 117-125, Nov. 1991.
[27] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, 1995.
[28] T. Seidl and H.-P. Kriegel, “Optimal Multi-Step k-Nearest Neighbor Search,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 154-165, 1998.
[29] J.S. Vitter and M. Wang, Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets Proc. ACM SIGMOD Conf. Management of Data (SIGMOD '99), pp. 193-204, 1999.

Index Terms:
Spatial databases, k{\hbox{-}}{\rm{distance}} join, incremental distance join, adaptive query processing, multistage query processing, plane sweeping, sweeping index, estimating cutoff distance.
Citation:
Hyoseop Shin, Bongki Moon, Sukho Lee, "Adaptive and Incremental Processing for Distance Join Queries," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 6, pp. 1561-1578, Nov.-Dec. 2003, doi:10.1109/TKDE.2003.1245293
Usage of this product signifies your acceptance of the Terms of Use.