The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2009 vol.21)
pp: 1162-1177
Yunjun Gao , Singapore Management University, Singapore
Baihua Zheng , Singapore Management University, Singapore
Gencai Chen , Zhejiang University, Hangzhou
Qing Li , City University of Hong Kong, Hong Kong
ABSTRACT
This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding d_c. When there is a tie, the accumulated distance from the data objects to b serves as the tie breaker, and the one with smaller distance has the better optimality. In this paper, we present the optimality metric, formalize the OLS query, and propose several algorithms for processing OLS queries efficiently. A comprehensive experimental evaluation has been conducted using both real and synthetic data sets to demonstrate the efficiency and effectiveness of the proposed algorithms.
INDEX TERMS
Query processing, optimal-location-selection, spatial database, algorithm.
CITATION
Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, "Optimal-Location-Selection Query Processing in Spatial Databases", IEEE Transactions on Knowledge & Data Engineering, vol.21, no. 8, pp. 1162-1177, August 2009, doi:10.1109/TKDE.2009.81
REFERENCES
[1] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R$^\ast$ -Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 322-331, 1990.
[2] S. Berchtold, D.A. Keim, and H.-P. Kriegel, “The X-Tree: An Index Structure for High-Dimensional Data,” Proc. Very Large Data Bases Conf. (VLDB '96) , pp. 28-39, 1996.
[3] C. Bohm and F. Krebs, “High Performance Data Mining Using the Nearest Neighbor Join,” Proc. Int'l Conf. Data Mining (ICDM '02), pp.43-50, 2002.
[4] T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using R-Trees,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 237-246, 1993.
[5] K.L. Cheung and A.W.-C. Fu, “Enhanced Nearest Neighbour Search on the R-Tree,” SIGMOD Record, vol. 27, no. 3, pp. 16-21, 1998.
[6] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Closest Pair Queries in Spatial Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 189-200, 2000.
[7] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Algorithms for Processing $k$ -Closest-Pair Queries in Spatial Databases,” Data & Knowledge Eng., vol. 49, no. 1, pp. 67-104, 2004.
[8] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Multi-Way Distance Join Queries in Spatial Databases,” GeoInformatica, vol. 8, no. 4, pp. 373-402, 2004.
[9] K. Deng, X. Zhou, H. Shen, K. Xu, and X. Lin, “Surface $k$ -NN Query Processing,” Proc. Int'l Conf. Data Eng. (ICDE '06), p. 78, 2006.
[10] Y. Du, D. Zhang, and T. Xia, “The Optimal-Location Query,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '05), pp. 163-180, 2005.
[11] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. Abbadi, “Constrained Nearest Neighbor Queries,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '01), pp. 257-278, 2001.
[12] E. Frentzos, K. Gratsias, N. Pelekis, and Y. Theodoridis, “Algorithms for Nearest Neighbor Search on Moving Object Trajectories,” GeoInformatica, vol. 11, no. 2, pp. 159-193, 2007.
[13] Y. Gao, C. Li, G. Chen, L. Chen, X. Jiang, and C. Chen, “Efficient $k$ -Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories,” J. Computer Science and Technology, vol. 22, no. 2, pp.232-244, 2007.
[14] Y. Gao, C. Li, G. Chen, Q. Li, and C. Chen, “Efficient Algorithms for Historical Continuous $k$ nn Query Processing over Moving Object Trajectories,” Proc. Joint Int'l Conf. Asia-Pacific Web Conf. (APWeb)/Web-Age Information Management (WAIM '07), pp. 188-199, 2007.
[15] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 47-57, 1984.
[16] G.R. Hjaltason and H. Samet, “Incremental Distance Join Algorithms for Spatial Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 237-248, 1998.
[17] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[18] H. Hu and D.L. Lee, “Range Nearest-Neighbor Query,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 78-91, Jan. 2006.
[19] F. Korn and S. Muthukrishnan, “Influence Sets Based on Reverse Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 201-212, 2000.
[20] N. Koudas and K. Sevcik, “High Dimensional Similarity Joins: Algorithms and Performance Evaluation,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 1, pp. 3-18, Jan./Feb. 2000.
[21] N. Mamoulis and D. Papadias, “Multiway Spatial Joins,” ACM Trans. Database Systems, vol. 26, no. 4, pp. 424-475, 2001.
[22] K. Mouratidis, M. Hadjieleftheriou, and D. Papadias, “Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitorin,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 634-645, 2005.
[23] K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao, “A Threshold-Based Algorithm for Continuous Monitoring of $k$ Nearest Neighbors,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 1451-1464, Nov. 2005.
[24] K. Mouratidis, M. Yiu, D. Papadias, and N. Mamoulis, “Continuous Nearest Neighbor Monitoring in Road Networks,” Proc. Very Large Data Bases Conf. (VLDB '06), pp. 43-54, 2006.
[25] A. Nanopoulos, Y. Theodoridis, and Y. Manolopoulos, “C2P: Clustering Based on Closest Pairs,” Proc. Very Large Data Bases Conf. (VLDB '01) , pp. 331-340, 2001.
[26] B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, “Towards an Analysis of Range Query Performance in Spatial Data Structures,” Proc. ACM Symp. Principles of Database Systems (PODS '93), pp.214-221, 1993.
[27] D. Papadias and D. Arkoumanis, “Approximate Processing of Multiway Spatial Joins in Very Large Databases,” Proc. Int'l Conf. Extending Database Technology (EDBT '02), pp. 179-196, 2002.
[28] D. Papadias, N. Mamoulis, and D. Theodoridis, “Processing and Optimization of Multiway Spatial Joins Using R-Trees,” Proc. ACM Symp. Principles of Database Systems (PODS '99), pp. 44-55, 1999.
[29] D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, “Group Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng. (ICDE '04), pp. 301-312, 2004.
[30] D. Papadias, Y. Tao, K. Mouratidis, and K. Hui, “Aggregate Nearest Neighbor Queries in Spatial Databases,” ACM Trans. Database Systems, vol. 30, no. 2, pp. 529-576, 2005.
[31] A. Papadopoulos and Y. Manolopoulos, “Performance of Nearest Neighbor Queries in R-Trees,” Proc. Int'l Conf. Database Theory (ICDT '97), pp. 394-408, 1997.
[32] A. Papadopoulos, A. Nanopoulos, and Y. Manolopoulos, “Processing Distance Join Queries with Constraints,” The Computer J., vol. 49, no. 3, pp. 281-296, 2006.
[33] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp.71-79, 1995.
[34] J. Shan, D. Zhang, and B. Salzberg, “On Spatial-Range Closest-Pair Query,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '03), pp.252-269, 2003.
[35] H. Shin, B. Moon, and S. Lee, “Adaptive Multi-Stage Distance Join Processing,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 343-354, 2000.
[36] H. Shin, B. Moon, and S. Lee, “Adaptive and Incremental Processing for Distance Join Queries,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 6, pp. 1561-1578, Nov./Dec. 2003.
[37] Y. Shou, N. Mamoulis, H. Cao, D. Papadias, and D.W. Cheung, “Evaluation of Iceberg Distance Joins,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '03), pp. 270-288, 2003.
[38] Z. Song and N. Roussopoulos, “$k$ -Nearest Neighbor Search for Moving Query Point,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '01), pp. 79-96, 2001.
[39] Y. Tao, D. Papadias, X. Lian, and X. Xiao, “Multidimensional Reverse $k$ NN Search,” The Very Large Data Bases J., vol. 16, no. 3, pp. 293-316, 2007.
[40] Y. Tao, D. Papadias, and Q. Shen, “Continuous Nearest Neighbor Search,” Proc. Int'l Conf. Very Large Data Bases (VLDB '02), pp. 287-298, 2002.
[41] X. Xiong, M. Mokbel, and W. Aref, “SEA-CNN: Scalable Processing of Continuous $k$ -Nearest Neighbor Queries in Spatio-Temporal Databases,” Proc. Int'l Conf. Data Eng. (ICDE '05), pp.643-654, 2005.
[42] X. Yu, K. Pu, and N. Koudas, “Monitoring $k$ -Nearest Neighbor Queries over Moving Objects,” Proc. Int'l Conf. Data Eng. (ICDE '05), pp. 631-642, 2005.
[43] J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao, “All-Nearest-Neighbors Queries in Spatial Databases,” Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM '04), pp. 297-306, 2004.
[44] M. Zhu, D. Papadias, J. Zhang, and D.L. Lee, “Top-$k$ Spatial Joins,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 4, pp. 567-579, Apr. 2005.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool