Abstract
Given an object set O and a query object q, the reverse furthest neighbor (RFN) query retrieves the objects in O, whose furthest neighbor is q. In this paper, we consider the arbitrary RFN query that is without constraint of its location. The state-of-the-art method is not efficient for such kind of queries. Therefore, we address this problem by introducing our new findings on the filtering techniques. Firstly, we show the evidence that exhibits the inefficiency of the state-of-the-art method. We then figure out a non-trivial safe area to guarantee the efficiency for query processing, even meeting the ideal efficiency. We also design an efficient algorithm to answer the RFN query without any cost of filtering or refinement, when q is located in such safe area. Extensive experiments on both synthetic and real datasets are conducted to evaluate the effectiveness, efficiency and scalability of our algorithm. The results sufficiently indicate that our algorithm significantly outperforms the competitive ones in all the aspects.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Achtert, E., Böhm, C., Kröger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: SIGMOD, pp. 515–526 (2006)
Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location: the voronoi game. Theor. Comput. Sci. 310(1-3), 457–467 (2004)
Athitsos, V., Potamias, M., Papapetrou, P., Kollios, G.: Nearest neighbor retrieval using distance-based hashing. In: ICDE, pp. 327–336 (2008)
Bhattacharya, B.K., Toussaint, G.T.: Fast algorithms for computing the diameter of a finite planar set. The Visual Computer 3(6), 379–388 (1988)
Cabello, S., Díaz-Báñez, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research 202(1), 99–106 (2010)
Chen, H., Liu, J., Furuse, K., Yu, J.X., Ohbo, N.: Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol. 5678, pp. 67–78. Springer, Heidelberg (2009)
Chen, H., Liu, J., Furuse, K., Yu, J.X., Ohbo, N.: Indexing expensive functions for efficient multi-dimensional similarity search. Knowl. Inf. Syst. 27(2), 165–192 (2011)
Dasci, A., Laporte, G.: A continuous model for multistore competitive location. Operations Research 53(2), 263–280 (2005)
Hale, T.S., Moberg, C.R.: Location science research: A review. Annals OR 123(1-4), 21–35 (2003)
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201–212 (2000)
Lian, X., Chen, L.: Similarity search in arbitrary subspaces under lp-norm. In: ICDE, pp. 317–326 (2008)
Liu, J., Chen, H., Furuse, K., Kitagawa, H.: An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part II. LNCS, vol. 6262, pp. 437–451. Springer, Heidelberg (2010)
Plastria, F.: Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research 129(3), 461–470 (2001)
Plastria, F., Vanhaverbeke, L.: Discrete models for competitive location with foresight. Computers & OR 35(3), 683–700 (2008)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)
Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99–108 (2001)
Tao, Y., Papadias, D., Lian, X., Xiao, X.: Multidimensional reverse knn search. VLDB J. 16(3), 293–316 (2007)
Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp. 563–576 (2009)
Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: Finch: evaluating reverse k-nearest-neighbor queries on location data. PVLDB 1(1), 1056–1067 (2008)
Yao, B., Li, F., Kumar, P.: Reverse furthest neighbors in spatial databases. In: ICDE, pp. 664–675 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Chen, H., Furuse, K., Kitagawa, H. (2012). An Efficient Algorithm for Arbitrary Reverse Furthest Neighbor Queries. In: Sheng, Q.Z., Wang, G., Jensen, C.S., Xu, G. (eds) Web Technologies and Applications. APWeb 2012. Lecture Notes in Computer Science, vol 7235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29253-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-29253-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29252-1
Online ISBN: 978-3-642-29253-8
eBook Packages: Computer ScienceComputer Science (R0)