This Article 
 Bibliographic References 
 Add to: 
On Computing Farthest Dominated Locations
June 2011 (vol. 23 no. 6)
pp. 928-941
Hua Lu, Aalborg University, Denmark
Man Lung Yiu, Hong Kong Polytechnic University, Hong Kong
In reality, spatial objects (e.g., hotels) not only have spatial locations but also have quality attributes (e.g., price, star). An object p is said to dominate another one p^{\prime }, if p is no worse than p^{\prime } with respect to every quality attribute and p is better on at least one quality attribute. Traditional spatial queries (e.g., nearest neighbor, closest pair) ignore quality attributes, whereas conventional dominance-based queries (e.g., skyline) neglect spatial locations. Motivated by these observations, we propose a novel query by combining spatial and quality attributes together meaningfully. Given a set of (competitors') spatial objects P, a set of (candidate) locations L, and a quality vector \Psi as design competence (for L), the farthest dominated location (FDL) query retrieves the location s \in L such that the distance to its nearest dominating object in P is maximized. FDL queries are suitable for various spatial decision support applications such as business planning, wild animal protection, and digital battle field systems. As FDL queries cannot be readily solved by existing techniques, we develop several efficient R-tree-based algorithms for processing FDL queries, which offer users a range of selections in terms of different indexes available on the data. We also generalize our methods to support the generic distance metric and other interesting query types. The experimental results on both real and synthetic data sets disclose the performance of those algorithms, and reveal the most efficient and scalable one among them.

[1] AllStays, http:/, 2011.
[2] Digital Battle Field, newsarticle.aspx?id=45084 , 2011.
[3] Wild Animal Rehabilitation Centre, http:/, 2011.
[4] T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," Geoinformatica, vol. 6, no. 2, pp. 153-180, 2002.
[5] S. Borzonyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001.
[6] 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.
[7] A.R. Butz, "Alternative Algorithm for Hilbert's Space-Filling Curve," IEEE Trans. Computers, vol. 20, no. 4, pp. 424-426, Apr. 1971.
[8] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Presorting," Proc. 19th Int'l Conf. Data Eng. (ICDE), pp. 717-719, 2003.
[9] P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 23rd Int'l Conf. Very Large Data Bases (VLDB), pp. 426-435, 1997.
[10] 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.
[11] Y. Du, D. Zhang, and T. Xia, "The Optimal-Location Query," Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), pp. 163-180, 2005.
[12] G. Hjaltason and H. Samet, "Distance Browsing in Spatial Database," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[13] X. Huang and C.S. Jensen, "In-Route Skyline Querying for Location-Based Services," Proc. Int'l Workshop Web and Wireless Geographical Information Systems (W2GIS), pp. 120-135, 2004.
[14] Z. Huang, H. Lu, B.C. Ooi, and A.K.H. Tung, "Continuous Skyline Queries for Moving Objects," IEEE Trans. Knowledge and Data Eng., vol. 18, no. 12, pp. 1645-1658, Dec. 2006.
[15] D. Kossmann, F. Ramsak, and S. Rost, "Shooting Stars in the Sky: An Online Algorithm for Skyline Queries," Proc. 28th Int'l Conf. Very Large Data Bases (VLDB), pp. 275-286, 2002.
[16] C. Li, A.K.H. Tung, W. Jin, and M. Ester, "On Dominating Your Neighborhood Profitably," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB), pp. 818-829, 2007.
[17] B. Moon, H.V. Jagadish, C. Faloutsos, and J.H. Saltz, "Analysis of the Clustering Properties of the Hilbert Space-Filling Curve," vol. 13, no. 1, pp. 124-141, 2001.
[18] D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An Optimal and Progressive Algorithm for Skyline Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 467-478, 2003.
[19] N. Roussopoulos, S. Kelley, and F. Vincent, "Nearest Neighbor Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 71-79, 1995.
[20] M. Sharifzadeh and C. Shahabi, "The Spatial Skyline Queries," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), pp. 751-762, 2006.
[21] S. Shekhar and S. Chawla, Spatial Databases: A Tour. Prentice Hall, 2003.
[22] K.L. Tan, P.K. Eng, and B.C. Ooi, "Efficient Progressive Skyline Computation," Proc. 27th Int'l Conf. Very Large Data Bases (VLDB), pp. 301-310, 2001.
[23] Y. Theodoridis and T.K. Sellis, "A Model for the Prediction of R-Tree Performance," Proc. 15th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS), pp. 161-171, 1996.
[24] T. Xia, D. Zhang, E. Kanoulas, and Y. Du, "On Computing Top-t Most Influential Spatial Sites," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB), pp. 946-957, 2005.
[25] M.L. Yiu, X. Dai, N. Mamoulis, and M. Vaitis, "Top-K Spatial Preference Queries," Proc. IEEE 23rd Int'l Conf. Data Eng. (ICDE), pp. 1076-1085, 2007.
[26] D. Zhang, Y. Du, T. Xia, and Y. Tao, "Progressive Computation of the Min-Dist Optimal-Location Query," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), pp. 643-654, 2006.
[27] B. Zheng, K.C.K. Lee, and W.-C. Lee, "Location-Dependent Skyline Query," Proc. Ninth Int'l Conf. Mobile Data Management (MDM), pp. 148-155, 2008.

Index Terms:
Spatial objects, query processing, database management.
Hua Lu, Man Lung Yiu, "On Computing Farthest Dominated Locations," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 6, pp. 928-941, June 2011, doi:10.1109/TKDE.2010.45
Usage of this product signifies your acceptance of the Terms of Use.