The VLDB Journal

, Volume 27, Issue 4, pp 445–470 | Cite as

Finding the optimal location and keywords in obstructed and unobstructed space

  • Farhana Murtaza ChoudhuryEmail author
  • J. Shane Culpepper
  • Zhifeng Bao
  • Timos Sellis
Regular Paper


The problem of optimal location selection based on reverse k nearest neighbor (R \(k\) NN) queries has been extensively studied in spatial databases. In this work, we present a related query, denoted as a Maximized Bichromatic Reverse Spatial Textual k Nearest Neighbor (MaxST) query, that finds an optimal location and a set of keywords for an object so that the object is a \(k\) NN object for as many users as possible. Such a query has many practical applications including advertisements, where the query is to find the location and the text contents to include in an advertisement so that it is relevant to the maximum number of users. The visibility of the advertisements also has an important role in the users’ interests. In this work, we address two instances of the spatial relevance when ranking items: (1) the Euclidean distance and (2) the visibility. We carefully design a series of index structures and approaches to answer the MaxST for both instances. Specifically, we present (1) the Grp-topk approach that requires the computation of the top-k objects for all of the users first and then applies various pruning techniques to find the optimal location and keywords; (2) the Indiv-U approach, where we use similarity estimations to avoid computing the top-k objects of the users that cannot be a final result; and (3) the Index-U approach where we propose a hierarchical index structure over the users to improve pruning. We show that the keyword selection component in MaxST queries is NP-hard and present both approximate and exact solutions for the problem.


Spatial–textual query Reverse kNN Efficiency 



This work was supported by the Australian Research Council’s Discovery Projects Scheme (Grants DP140101587, DP170102231, and DP170102726) and Google Faculty Research Award. This work was partially supported by the National Natural Science Foundation of China (NSFC) 91646204. Farhana Choudhury is the recipient of a scholarship from National ICT Australia. We thank Lisi Chen, Gao Cong, Christian S. Jensen, and Dingming Wu for providing the implementation of the IR-tree in [3].


  1. 1.
    Cardinal, J.J., Langerman, S.L.: Min-max-min geometric facility location problems. In: EWCG, pp. 149–152 (2006)Google Scholar
  2. 2.
    Chen, Z., Liu, Y., Chi-Wing Wong, R., Xiong, J., Mai, G., Long, C.: Efficient algorithms for optimal location queries in road networks. In: SIGMOD (2014)Google Scholar
  3. 3.
    Chen, L., Cong, G., Jensen, C.S., Wu, D.: Spatial keyword query processing: an experimental evaluation. PVLDB 6(3), 217–228 (2013)Google Scholar
  4. 4.
    Chen, J., Huang, J., Wen, Z., He, Z., Taylor, K., Zhang, R.: Analysis and evaluation of the top-k most influential location selection query. Knowl. Inf. Syst. 43(1), 181–217 (2015)CrossRefGoogle Scholar
  5. 5.
    Chen, Z., Liu, Y., Wong, R.C.-W., Xiong, J., Mai, G., Long, C.: Optimal location queries in road networks. ACM Trans. Database Syst. 40(3), 1–41 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Choudhury, F.M., Culpepper, J.S., Sellis, T.: Batch processing of top-k spatial-textual queries. In: GeoRich, pp. 7–12 (2015)Google Scholar
  7. 7.
    Choudhury, F.M., Ali, M.E., Masud, S., Nath, S., Rabban, I.E.: Scalable visibility color map construction in spatial databases. Inf. Syst. 42, 89–106 (2014)CrossRefGoogle Scholar
  8. 8.
    Choudhury, F.M., Culpepper, J.S., Sellis, T., Cao, X.: Maximizing bichromatic reverse spatial and textual k nearest neighbor queries. PVLDB 9(6), 456–467 (2016)Google Scholar
  9. 9.
    Cong, G., Jensen, C.S., Wu, D.: Efficient retrieval of the top-k most relevant spatial web objects. PVLDB 2(1), 337–348 (2009)Google Scholar
  10. 10.
    Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Gao, Y., Yang, J., Chen, G., Zheng, B., Chen, C.: On efficient obstructed reverse nearest neighbor query processing. In: GIS, pp. 191–200 (2011)Google Scholar
  12. 12.
    Gao, Y., Zheng, B., Chen, G., Lee, W.C., Lee, K.C.K., Li, Q.: Visible reverse k-nearest neighbor query processing in spatial databases. TKDE 21(9), 1314–1327 (2009)Google Scholar
  13. 13.
    Gao, Y., Liu, Q., Miao, X., Yang, J.: Reverse k-nearest neighbor search in the presence of obstacles. Inf. Sci. 330, 274–292 (2016)CrossRefGoogle Scholar
  14. 14.
    Gkorgkas, O., Vlachou, A., Doulkeridis, C., Nørvåg, K.: Maximizing influence of spatio-textual objects based on keyword selection. In: SSTD, pp. 413–430 (2015)Google Scholar
  15. 15.
    Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)Google Scholar
  16. 16.
    Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston (1997)zbMATHGoogle Scholar
  17. 17.
    Huang, J., Wen, Z., Qi, J., Zhang, R., Chen, J., He, Z.: Top-k most influential locations selection. In: CIKM, pp. 2377–2380 (2011)Google Scholar
  18. 18.
    Lin, H., Chen, F., Gao, Y., Lu, D.: OptRegion: finding optimal region for bichromatic reverse nearest neighbors. In: DASFAA, pp. 146–160 (2013)Google Scholar
  19. 19.
    Lin, Q., Xiao, C., Cheema, M.A., Wang, W.: Finding the sites with best accessibilities to amenities. In: DASFAA, pp. 58–72 (2011)Google Scholar
  20. 20.
    Liu, Y., Wong, R.-W., Wang, K., Li, Z., Chen, C., Chen, Z.: A new approach for maximizing bichromatic reverse nearest neighbor search. Knowl. Inf. Syst. 36(1), 23–58 (2013)CrossRefGoogle Scholar
  21. 21.
    Lu, J., Lu, Y., Cong, G.: Reverse spatial and textual k nearest neighbor search. In: SIGMOD, pp. 349–360 (2011)Google Scholar
  22. 22.
    Lu, Y., Lu, J., Cong, G., Wu, W., Shahabi, C.: Efficient algorithms and cost models for reverse spatial-keyword k-nearest neighbor search. ACM Trans. Database Syst. 39(2), 1–46 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)CrossRefzbMATHGoogle Scholar
  24. 24.
    Masud, S., Choudhury, F.M., Ali, M.E., Nutanong, S.: Maximum visibility queries in spatial databases. In: ICDE, pp. 637–648 (2013)Google Scholar
  25. 25.
    Nutanong, S., Tanin, E., Zhang, R.: Incremental evaluation of visible nearest neighbor queries. TKDE 22(5), 665–681 (2010)Google Scholar
  26. 26.
    Papadias, D., Qiongmao, S., Yufei, T., Kyriakos, M.: Group nearest neighbor queries. In: ICDE, pp. 301–312 (2004)Google Scholar
  27. 27.
    Qi, J., Rui, Z., Kulik, L., Lin, D., Yuan, X.: The min-dist location selection query. In: ICDE, pp. 366–377 (2012)Google Scholar
  28. 28.
    Qi, J., Xu, Z., Xue, Y., Wen, Z.: A branch and bound method for min-dist location selection queries. In: ADC, pp. 51–60 (2012)Google Scholar
  29. 29.
    Rabban, I.E., Abdullah, K., Ali, M.E., Cheema, M.A.: Visibility color map for a fixed or moving target in spatial databases. In: SSTD, pp. 197–215 (2015)Google Scholar
  30. 30.
    Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Inf. Process. Manage. 24(5), 513–523 (1988)CrossRefGoogle Scholar
  31. 31.
    Sun, Y., Huang, J., Chen, Y., Zhang, R., Du, X.: Location selection for utility maximization with capacity constraints. In: CIKM, pp. 2154–2158 (2012)Google Scholar
  32. 32.
    Wang, Y., Gao, Y., Chen, L., Chen, G., Li, Q.: All-visible-k-nearest-neighbor queries. In: DEXA, pp. 392–407 (2012)Google Scholar
  33. 33.
    Wong, R.C.-W., Özsu, M.T., Yu, P.S., Fu, A.W.-C., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. PVLDB 2(1), 1126–1137 (2009)Google Scholar
  34. 34.
    Wong, R.C.-W., Özsu, M.T., Fu, A.W.-C., Yu, P.S., Liu, L., Liu, Y.: Maximizing bichromatic reverse nearest neighbor for lp-norm in two and three-dimensional spaces. PVLDB 20(6), 893–919 (2011)Google Scholar
  35. 35.
    Xia, T., Zhang, D., Kanoulas, E., Du, Y.: On computing top-t most influential spatial sites. In: VLDB, pp. 946–957 (2005)Google Scholar
  36. 36.
    Xiao, X., Yao, B., Li, F.: Optimal location queries in road network databases. In: ICDE (2011)Google Scholar
  37. 37.
    Xie, X., Lin, X., Xu, J., Jensen, C.: Reverse keyword-based location search. In: ICDE (2017). (to appear)Google Scholar
  38. 38.
    Yan, D., Wong, R.C.-W., Ng, W.: Efficient methods for finding influential locations with adaptive grids. In: CIKM, pp. 1475–1484 (2011)Google Scholar
  39. 39.
    Yan, D., Zhao, Z., Ng, W.: Efficient algorithms for finding optimal meeting point on road networks. PVLDB 4(11), 968–979 (2011)Google Scholar
  40. 40.
    Yan, D., Zhao, Z., Ng, W.: Efficient processing of optimal meeting point queries in euclidean space and road networks. Knowl. Inf. Syst. 42(2), 319–351 (2015)CrossRefGoogle Scholar
  41. 41.
    Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB, pp. 643–654 (2006)Google Scholar
  42. 42.
    Zhang, C., Shou, L., Chen, K., Chen, G.: See-to-retrieve: efficient processing of spatio-visual keyword queries. In: SIGIR, pp. 681–690 (2012)Google Scholar
  43. 43.
    Zhou, Z., Wu, W., Li, X., Lee, M.L., Hsu, W.: MaxFirst for MaxBRkNN. In: ICDE, pp. 828–839 (2011)Google Scholar
  44. 44.
    Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. ACM Trans. Database Syst. 23(4), 453–490 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.RMIT UniversityMelbourneAustralia
  2. 2.Swinburne University of TechnologyHawthornAustralia

Personalised recommendations