Knowledge and Information Systems

, Volume 43, Issue 1, pp 181–217 | Cite as

Analysis and evaluation of the top-\(k\) most influential location selection query

  • Jian Chen
  • Jin Huang
  • Zeyi Wen
  • Zhen He
  • Kerry Taylor
  • Rui Zhang
Regular Paper


In this paper, we propose a new type of queries to retrieve the top-k most influential locations from a candidate set \(C\) given sets of customers \(M\) and existing facilities \(F\). The influence models the popularity of a facility. Such queries have wide applications in decision support systems. A naive solution sequentially scans (SS) all data sets, which is expensive, and hence, we investigate two branch-and-bound algorithms for the query, namely Estimate Expanding Pruning (EEP) and Bounding Influence Pruning (BIP). Both algorithms follow the best first traverse. On determining the traversal order, while EEP leverages distance metrics between nodes, BIP relies on half plane pruning which avoids the repetitive estimations in EEP. As our experiments shown, BIP is much faster than SS which outperforms EEP, while the worst-case complexity of EEP and BIP is worse than that of SS. To improve the efficiency, we further propose a Nearest Facility Circle Join (NFCJ) algorithm. NFCJ builds an influence R-tree on the influence relationship between customers and existing facilities and joins the candidate R-tree with the influence R-tree to obtain the results. We compare all algorithms and conclude that NFCJ is the best solution, which outperforms SS, EEP, and BIP by orders of magnitude.


Reverse nearest neighbor R-tree Efficiency  Location selection 



This work was supported in part by the National Natural Science Foundation of China (No. 61272065) and the Natural Science Foundation of Guangdong Province, China (No. S2012010009311), the Fundamental Research Funds for the Central Universities, SCUT(Grant No. 2012ZZ0088), and the Australian Research Council (ARC) Discovery Project DP130104587. Dr. Rui Zhang was supported by the ARC Future Fellowships Project FT120100832. Zeyi Wen was supported by the Commonwealth Scientific and Industrial Research Organisation (CSIRO).


  1. 1.
    Achtert E, Kriegel HP, Krger P, Renz M, Zfle A (2009) Reverse k-nearest neighbor search in dynamic and general metric databases. In: Proceedings of EDBTGoogle Scholar
  2. 2.
  3. 3.
    Aronovich L, Spiegler I (2009) Bulk construction of dynamic clustered metric trees. Knowl Inf Syst 22(2):211–244CrossRefGoogle Scholar
  4. 4.
    Brinkhoff T, Kriegel HP, Seeger B (1993) Efficient processing of spatial joins using r-trees. In: Proceedings of SIGMODGoogle Scholar
  5. 5.
    Cabello S, Díaz-Báñez JM, Langerman S, Seara C, Ventura I (2006) Reverse facility location problems. In: Proceedings of CCCGGoogle Scholar
  6. 6.
    Cheema MA, Lin X, Wang W, Zhang W, Pei J (2010) Probabilistic reverse nearest neighbor queries on uncertain data. IEEE TKDE 22(4):550–564Google Scholar
  7. 7.
    Cheema MA, Lin X, Zhang W, Zhang Y (2011) Influence zone : efficiently processing reverse k nearest neighbors queries. In: Proceedings of ICDEGoogle Scholar
  8. 8.
    Cheema MA, Zhang W, Lin X, Zhang Y (2012) Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB JGoogle Scholar
  9. 9.
    Chen H, Liu J, Furuse K, Yu JX, Ohbo N (2010) Indexing expensive functions for efficient multi-dimensional similarity search. Knowl Inf Syst 27(2):165–192CrossRefGoogle Scholar
  10. 10.
  11. 11.
    Du Y, Zhang D, Xia T (2005) The optimal-location query. Adv Sp Temp Databases 3633:163–180CrossRefGoogle Scholar
  12. 12.
    Gao Y, Zheng B, Chen G, Li Q (2009) Optimal-location-selection query processing in spatial databases. IEEE TKDE 68(8):1162–1177Google Scholar
  13. 13.
    Ghaemi P, Shahabi K, Wilson JP, Banaei-Kashani F (2010) Optimal network location queries. In: Proceedings of GISGoogle Scholar
  14. 14.
    Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of SIGMOD, pp 47–57Google Scholar
  15. 15.
    Huang J, Wen Z, Qi J, Zhang R, Chen J, He Z (2011) Top-k most influential location selection. In: Proceedings of CIKMGoogle Scholar
  16. 16.
    Korn F, Muthukrishnan S (2000) Influence sets based on reverse nearest neighbor queries. In: Proceedings of SIGMODGoogle Scholar
  17. 17.
    Mouratidis K, Papadias D, Papadimitriou S (2005) Medoid queries in large spatial databases. In: Proceedings of SSTD, pp 55–72Google Scholar
  18. 18.
    OpenStreetMap (2013)
  19. 19.
    Qi J, Zhang R, Kulik L, Lin D, Xue Y (2012) The min-dist location selection query. In: Proceedings of ICDEGoogle Scholar
  20. 20.
    Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proceedings of SIGMOD, pp 71–79Google Scholar
  21. 21.
    Shang S, Yuan B, Deng K, Xie K, Zhou X (2011) Finding the most accessible locations-reverse path nearest neighbor query in road networks categories and subject descriptors. In: Proceedings of GISGoogle Scholar
  22. 22.
    SouFang (2013)
  23. 23.
    Stanoi I, Riedewald M, Agrawal D, Abbadi AE (2001) Discovery of influence sets in frequently updated database. In: Proceedings of VLDBGoogle Scholar
  24. 24.
    Sun Y, Huang J, Chen Y, Zhang R, Du X (2012) Location selection for utility maximization with capacity constraints. In: Proceedings of CIKMGoogle Scholar
  25. 25.
    Tao Y, Lian X (2004) Reverse kNN search in arbitrary dimensionality. In: Proceedings of VLDBGoogle Scholar
  26. 26.
    Trulia (2013)
  27. 27.
    Vaidya PM (1989) AnO(n logn) algorithm for the all-nearest-neighbors problem. Discret Comput Geom 4(1):101–115Google Scholar
  28. 28.
    Wong RCW, Özsu MT, Fu AWC, Yu PS, Liu L, Liu Y (2011) Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces. VLDB J 20(6):893–919CrossRefGoogle Scholar
  29. 29.
    Wong RCW, Ozsu MT, Yu PS, Fu AWC, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. In: Proceedings of VLDBGoogle Scholar
  30. 30.
    Wu W, Yang F, Chan CY, Tan KL (2008) FINCH: evaluating reverse k-nearest-neighbor queries on location data. In: Proceedings of VLDBGoogle Scholar
  31. 31.
    Xia T, Zhang D, Kanoulas E, Du Y (2005) On computing top-t most influential spatial sites. In: Proceedings of VLDBGoogle Scholar
  32. 32.
    Yan D, Wong RCW, Ng W (2011) Efficient methods for finding influential locations with adaptive grids. In: Proceedings of CIKM, pp 1475–1484Google Scholar
  33. 33.
    Yang C, Lin KI (2001) An index structure for efficient reverse nearest neighbor queries. In: Proceedings of ICDE, pp 485–492Google Scholar
  34. 34.
    Zhang D, Du Y, Xia T, Tao Y (2006) Progressive computation of the min-dist optimal location query. In: Proceedings of VLDBGoogle Scholar
  35. 35.
    Zhang J, Mamoulis N, Papadias D, Tao Y (2004) All-nearest-neighbors queries in spatial databases. In: Proceedings of SSDM, pp 297–306Google Scholar
  36. 36.
    Zheng K, Huang Z, Zhou A, Zhou X (2011) Discovering the most influential sites over uncertain data: a rank based approach. IEEE TKDEGoogle Scholar

Copyright information

© Springer-Verlag London 2014

Authors and Affiliations

  • Jian Chen
    • 1
  • Jin Huang
    • 2
  • Zeyi Wen
    • 2
  • Zhen He
    • 3
  • Kerry Taylor
    • 4
  • Rui Zhang
    • 2
  1. 1.School of Software EngineeringSouth China University of TechnologyGuangzhouChina
  2. 2.Department of Computing and Information SystemsUniversity of MelbourneMelbourneAustralia
  3. 3.Department of Computer ScienceLa Trobe UniversityBundooraAustralia
  4. 4.The Commonwealth Scientific and Industrial Research Organisation (CSIRO)CanberraAustralia

Personalised recommendations