
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, "OptimalLocationSelection Query Processing in Spatial Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 8, pp. 11621177, August, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2009.81, author = {Yunjun Gao and Baihua Zheng and Gencai Chen and Qing Li}, title = {OptimalLocationSelection Query Processing in Spatial Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {8}, issn = {10414347}, year = {2009}, pages = {11621177}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.81}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  OptimalLocationSelection Query Processing in Spatial Databases IS  8 SN  10414347 SP1162 EP1177 EPD  11621177 A1  Yunjun Gao, A1  Baihua Zheng, A1  Gencai Chen, A1  Qing Li, PY  2009 KW  Query processing KW  optimallocationselection KW  spatial database KW  algorithm. VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[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. 322331, 1990.
[2] S. Berchtold, D.A. Keim, and H.P. Kriegel, “The XTree: An Index Structure for HighDimensional Data,” Proc. Very Large Data Bases Conf. (VLDB '96) , pp. 2839, 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.4350, 2002.
[4] T. Brinkhoff, H.P. Kriegel, and B. Seeger, “Efficient Processing of Spatial Joins Using RTrees,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 237246, 1993.
[5] K.L. Cheung and A.W.C. Fu, “Enhanced Nearest Neighbour Search on the RTree,” SIGMOD Record, vol. 27, no. 3, pp. 1621, 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. 189200, 2000.
[7] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “Algorithms for Processing $k$ ClosestPair Queries in Spatial Databases,” Data & Knowledge Eng., vol. 49, no. 1, pp. 67104, 2004.
[8] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, “MultiWay Distance Join Queries in Spatial Databases,” GeoInformatica, vol. 8, no. 4, pp. 373402, 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 OptimalLocation Query,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '05), pp. 163180, 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. 257278, 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. 159193, 2007.
[13] Y. Gao, C. Li, G. Chen, L. Chen, X. Jiang, and C. Chen, “Efficient $k$ NearestNeighbor Search Algorithms for Historical Moving Object Trajectories,” J. Computer Science and Technology, vol. 22, no. 2, pp.232244, 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. AsiaPacific Web Conf. (APWeb)/WebAge Information Management (WAIM '07), pp. 188199, 2007.
[15] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 4757, 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. 237248, 1998.
[17] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, 1999.
[18] H. Hu and D.L. Lee, “Range NearestNeighbor Query,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 1, pp. 7891, 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. 201212, 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. 318, Jan./Feb. 2000.
[21] N. Mamoulis and D. Papadias, “Multiway Spatial Joins,” ACM Trans. Database Systems, vol. 26, no. 4, pp. 424475, 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. 634645, 2005.
[23] K. Mouratidis, D. Papadias, S. Bakiras, and Y. Tao, “A ThresholdBased Algorithm for Continuous Monitoring of $k$ Nearest Neighbors,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 14511464, 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. 4354, 2006.
[25] A. Nanopoulos, Y. Theodoridis, and Y. Manolopoulos, “C2P: Clustering Based on Closest Pairs,” Proc. Very Large Data Bases Conf. (VLDB '01) , pp. 331340, 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.214221, 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. 179196, 2002.
[28] D. Papadias, N. Mamoulis, and D. Theodoridis, “Processing and Optimization of Multiway Spatial Joins Using RTrees,” Proc. ACM Symp. Principles of Database Systems (PODS '99), pp. 4455, 1999.
[29] D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, “Group Nearest Neighbor Queries,” Proc. Int'l Conf. Data Eng. (ICDE '04), pp. 301312, 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. 529576, 2005.
[31] A. Papadopoulos and Y. Manolopoulos, “Performance of Nearest Neighbor Queries in RTrees,” Proc. Int'l Conf. Database Theory (ICDT '97), pp. 394408, 1997.
[32] A. Papadopoulos, A. Nanopoulos, and Y. Manolopoulos, “Processing Distance Join Queries with Constraints,” The Computer J., vol. 49, no. 3, pp. 281296, 2006.
[33] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp.7179, 1995.
[34] J. Shan, D. Zhang, and B. Salzberg, “On SpatialRange ClosestPair Query,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD '03), pp.252269, 2003.
[35] H. Shin, B. Moon, and S. Lee, “Adaptive MultiStage Distance Join Processing,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 343354, 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. 15611578, 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. 270288, 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. 7996, 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. 293316, 2007.
[40] Y. Tao, D. Papadias, and Q. Shen, “Continuous Nearest Neighbor Search,” Proc. Int'l Conf. Very Large Data Bases (VLDB '02), pp. 287298, 2002.
[41] X. Xiong, M. Mokbel, and W. Aref, “SEACNN: Scalable Processing of Continuous $k$ Nearest Neighbor Queries in SpatioTemporal Databases,” Proc. Int'l Conf. Data Eng. (ICDE '05), pp.643654, 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. 631642, 2005.
[43] J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao, “AllNearestNeighbors Queries in Spatial Databases,” Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM '04), pp. 297306, 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. 567579, Apr. 2005.