Adaptive and Incremental Processing for Distance Join Queries

IEEE Transactions on Knowledge and Data Engineering

Volumn 15, Issue 6, 2003, Pages 1561-1578

  Shin, Hyoseop ^a   Moon, Bongki ^b   Lee, Sukho ^c  

^a SAMSUNG Electronics   (South Korea)

^b University of Arizona   (United States)

^c Seoul National University   (South Korea)

Author keywords

Adaptive query processing; Estimating cutoff distance; Incremental distance join; K distance join; Multistage query processing; Plane sweeping; Spatial databases; Sweeping index

Indexed keywords

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; DATA PROCESSING; INTERNET; MULTIMEDIA SYSTEMS; ONLINE SYSTEMS; TREES (MATHEMATICS);

DISTANCE JOIN QUERIES; NODE EXPANSION;

DATABASE SYSTEMS;

EID: 0242493745     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2003.1245293     Document Type: Article

References (29)

1. L. Arge, O. Procopiuc, S. Ramaswamy, T. Suel, and J.S. Vitter, "Scalable Sweeping-Based Spatial Join," Proc. 24th Very Large Databases Conf., pp. 259-270, June 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. 1990 ACM-SIGMOD Conf., pp. 322-331, May 1990.
4. A. Belussi and C. Faloutsos, "Estimating the Selectivity of Spatial Queries Using the Correlation Fractal Dimension," Proc. 21st Very Large Databases Conf., pp. 299-310, Sept. 1995.
5. S. Berchtold, B. Ertl, D. Keim, H.-P. Kriegel, and T. Seidl, "Fast Nearest Neighbor Search in High-Dimensional Spaces," Proc. 14th Int'l Conf., Data Eng., Sept. 1998.
6. S. Berchtold, D.A. Keim, and H.-P. Kriegel, "The X-Tree: An Index Structure for High-Dimensional Data," Proc. 22nd Very Large Databases Conf., Sept. 1996.
7. T. Brinkhoff, H.-P. Kriegel, R. Schneider, and B. Seeger, "Multistep Processing of Spatial Joins," Proc. 3994 ACM-SIGMOD Conf., pp. 197-208, May 1994.
8. T. Brinkhoff, H.-P. Kriegel, and B. Seeger, "Efficient Processing of Spatial Joins Using R-Trees," Proc. 1993 ACM-SIGMOD Conf., pp. 237-246, May 1993.
9. M.J. Carey and D. Kossmann, "On Saying "Enough Already!" in SQL," Proc. 1997 ACM-SIGMOD Conf., pp. 219-230, May 1997.
10. M.J. Carey and D. Kossmann, "Reducing the Braking Distance of an SQL Query Engine," Proc. 24th Very Large Databases Conf., pp. 158-169, 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. 2000 ACM-SIGMOD Conf., pp. 177-188, May 2000.
14. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. 1984 ACM-SIGMOD Conf., pp. 47-57, June 1984.
15. G.R. Hjaltason and H. Samet, "Ranking in Spatial Databases," Proc. Fourth Int'l Symp. Large Spatial Databases (SSD'95), pp. 83-95, Sept. 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. 22nd Very Large Databases Conf., pp. 215-226, June 1996.
18. M.-L. Lo and C.V. Ravishankar, "Spatial Joins Using Seeded Trees.," Proc. 1994 ACM-SIGMOD Conf., pp. 209-220, May 1994.
19. M.-L. Lo and C.V. Ravishankar, "Spatial Hash-Join," Proc. 1996 ACM-SIGMOD Conf., 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. 1990 ACM-SIGMOD Conf., pp. 343-352, May 1990.
22. D. Papadias, N. Mamoulis, and Y. Theodoridis, "Processing and Optimization of Multiway Spatial Joins Using R-Trees," Proc. 1999 ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 44-55, June 1999.
23. J.M. Patel and D.J. DeWitt, "Partition Based Spatial-Merge Join," Proc. 1996 ACM-SIGMOD Conf., pp. 259-270, June 1996.
24. V. Poosala, "Histogram-Based Estimation Techniques in Data-bases," PhD thesis, Univ. of Wisconsin-Madison, 1997.
25. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introdution. New York: Springer-Verlag, 1985.
26. V. Ramasubramanian and K.K. Paliwal, "Fast k-Dimensional Tree Algorithms for Nearest Neighbor Search with Application to Vector Quantization Encoding," IEEE Trans. Signal Processing, vol. 40, no. 3, pp. 518-531, Mar. 1992.
27. N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. 1995 ACM-SIGMOD Conf., pp. 71-79, May 1995.
28. T. Seidl and H.-P. Kriegel, "Optimal Multistep k-Nearest Neighbor Search," Proc. 1998 ACM-SIGMOD Conf., pp. 154-165, June 1998.
29. J.S. Vitter and M. Wang, "Approximate Computation of Multi-dimensional Aggregates of Sparse Data Using Wavelets," Proc. 1999 ACM-SIGMOD Conf., pp. 193-204, June 1999.