, Volume 22, Issue 2, pp 237–268 | Cite as

Aggregate keyword nearest neighbor queries on road networks

  • Pengfei Zhang
  • Huaizhong Lin
  • Yunjun Gao
  • Dongming Lu


Given a group \(\mathcal {Q}\) of query points and a set \(\mathcal {P}\) of points of interest (POIs), aggregate nearest neighbor (ANN) queries find a POI p from \(\mathcal {P}\) that achieves the smallest aggregate distance. Specifically, the aggregate distance is defined over the set of distances between p and all query points in \(\mathcal {Q}\). Existing studies on ANN query mainly consider the spatial proximity, whereas the textual similarity has received considerable attention recently. In this work, we utilize user-specified query keywords to capture textual similarity. We study the aggregate keyword nearest neighbor (AKNN) queries, finding the POI that has the smallest aggregate distance and covers all query keywords. Nevertheless, existing methods on ANN query are either inapplicable or inefficient when applied to the AKNN query. To answer our query efficiently, we first develop a dual-granularity (DG) indexing schema. It preserves abstracts of the road network by a tree structure, and preserves detailed network information by an extended adjacency list. Then, we propose a minimal first search (MFS) algorithm. It traverses the tree and explores the node with the minimal aggregate distance iteratively. This method suffers from false hits arising from keyword tests. Thus, we propose the collaborative filtering technique, which performs keywords test by multiple keyword bitmaps collectively rather than by only one. Extensive experiments on both real and synthetic datasets demonstrate the superiority of our algorithms and optimizing strategies.


Nearest neighbor Keyword search Road network Index structure 



This work was supported by National Program on Key Basic Research Project (i.e., 973 Program) No.2012CB725305, the NSFC Grant No.61428204, the Scientific Innovation Act of STCSM No.13511504200 and No.15JC1402400, National Science and Technology Supporting plan No.2015BAH45F01, the public key plan of Zhejiang Province No.2014C23005, the cultural relic protection science and technology project of Zhejiang Province.


  1. 1.
    Abbasifard MR, Ghahremani B, Naderi H (2014) A survey on nearest neighbor search methods. International Journal of Computer Applications 95(25):39–52CrossRefGoogle Scholar
  2. 2.
    Ahmadi E, Nascimento MA (2016) k-optimal meeting points based on preferred paths. In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, p 47Google Scholar
  3. 3.
    Bao J, Liu X, Zhou R, Wang B (2016) Keyword-aware optimal location query in road network. In: WAIM. Springer, pp 164–177Google Scholar
  4. 4.
    Cao X, Cong G, Jensen CS, Ooi BC (2011) Collective spatial keyword querying. In: SIGMOD. ACM, pp 373–384Google Scholar
  5. 5.
    Cao X, Cong G, Guo T, Jensen CS, Ooi BC (2015) Efficient processing of spatial group keyword queries. TODS 40(2):13CrossRefGoogle Scholar
  6. 6.
    Chen K, Sun W, Tu C, Chen C, Huang Y (2012) Aggregate keyword routing in spatial database. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems. ACM, pp 430–433Google Scholar
  7. 7.
    Choi DW, Pei J, Lin X (2016) Finding the minimum spatial keyword cover. In: ICDE. IEEE, pp 685–696Google Scholar
  8. 8.
    Deng K, Sadiq S, Zhou X, Xu H, Fung GPC, Lu Y (2012) On group nearest group query processing. TKDE 24(2):295–308Google Scholar
  9. 9.
    Elmongui HG, Mokbel MF, Aref WG (2013) Continuous aggregate nearest neighbor queries. GeoInformatica 17(1):63–95CrossRefGoogle Scholar
  10. 10.
    Gao Y, Qin X, Zheng B, Chen G (2015) Efficient reverse top-k boolean spatial keyword queries on road networks. TKDE 27(5):1205–1218Google Scholar
  11. 11.
    Gao Y, Zhao J, Zheng B, Chen G (2016) Efficient collective spatial keyword query processing on road networks. TITS 17(2):469–480Google Scholar
  12. 12.
    Guo T, Cao X, Cong G (2015) Efficient algorithms for answering the m-closest keywords query. In: SIGMOD. ACM, pp 405–418Google Scholar
  13. 13.
    Guttman A (1984) R-trees: a dynamic index structure for spatial searching, vol 14. ACMGoogle Scholar
  14. 14.
    Houle ME, Ma X, Oria V (2015) Effective and efficient algorithms for flexible aggregate similarity search in high dimensional spaces. TKDE 27(12):3258–3273Google Scholar
  15. 15.
    Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning. In: Proceedings of the 1995 ACM/IEEE conference on Supercomputing. ACM, p 29Google Scholar
  16. 16.
    Li F, Yi K, Tao Y, Yao B, Li Y, Xie D, Wang M (2016) Exact and approximate flexible aggregate similarity search. VLDB J 25(3):317–338CrossRefGoogle Scholar
  17. 17.
    Li M, Chen L, Cong G, Gu Y, Yu G (2016) Efficient processing of location-aware group preference queries. In: CIKM. ACM, pp 559–568Google Scholar
  18. 18.
    Li Y, Li F, Yi K, Yao B, Wang M (2011) Flexible aggregate similarity search. In: SIGMOD. ACM, pp 1009–1020Google Scholar
  19. 19.
    Li Z, Xu H, Lu Y, Qian A (2010) Aggregate nearest keyword search in spatial databases. In: APWEB. IEEE, pp 15–21Google Scholar
  20. 20.
    Long C, Wong RCW, Wang K, Fu AWC (2013) Collective spatial keyword queries: a distance owner-driven approach. In: SIGMOD. ACM, pp 689–700Google Scholar
  21. 21.
    Luo Y, Chen H, Furuse K, Ohbo N (2007) Efficient methods in finding aggregate nearest neighbor by projection-based filtering. ICCSA pp 821–833Google Scholar
  22. 22.
    Luo Y, Furuse K, Chen H, Ohbo N (2007) Finding aggregate nearest neighbor efficiently without indexing. In: Proceedings of the 2nd international conference on Scalable information systems. ICST, p 48Google Scholar
  23. 23.
    Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: ICDE. IEEE, pp 301–312Google Scholar
  24. 24.
    Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. TODS 30(2):529–576CrossRefGoogle Scholar
  25. 25.
    Rocha-Junior JB, Nørvåg K (2012) Top-k spatial keyword queries on road networks. In: Proceedings of the 15th international conference on extending database technology. ACM, pp 168–179Google Scholar
  26. 26.
    Sadasivam S, Baba AI, Ku WS, Chen H (2015) A2n2: approximate aggregate nearest neighbor queries on road networks. In: Proceedings of the 4th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems. ACM, pp 13–22Google Scholar
  27. 27.
    Shekhar S, Liu DR (1997) Ccam: a connectivity-clustered access method for networks and network computations. TKDE 9(1):102–119Google Scholar
  28. 28.
    Singh V, Zong B, Singh AK (2016) Nearest keyword set search in multi-dimensional datasets. TKDE 28(3):741–755Google Scholar
  29. 29.
    Su S, Zhao S, Cheng X, Bi R, Cao X, Wang J (2017) Group-based collective keyword querying in road networks. Inf Process Lett 118:83–90CrossRefGoogle Scholar
  30. 30.
    Sun W, Chen C, Zheng B, Chen C, Zhu L, Liu W, Huang Y (2013) Merged aggregate nearest neighbor query processing in road networks. In: CIKM. ACM, pp 2243–2248Google Scholar
  31. 31.
    Sun W, Chen C, Zheng B, Chen C, Zhu L, Liu W, Huang Y (2015) Fast optimal aggregate point search for a merged set on road networks. Inform Sci 310:52–68CrossRefGoogle Scholar
  32. 32.
    Sun WW, Chen CN, Zhu L, Gao YJ, Jing YN, Li Q (2015) On efficient aggregate nearest neighbor query processing in road networks. JCST 30(4):781–798Google Scholar
  33. 33.
    Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. Proceedings of the VLDB Endowment 4(11)Google Scholar
  34. 34.
    Yan D, Zhao Z, Ng W (2015) Efficient processing of optimal meeting point queries in euclidean space and road networks. KIS 42(2):319–351Google Scholar
  35. 35.
    Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. TKDE 17(6):820–833Google Scholar
  36. 36.
    Zhang D, Chee YM, Mondal A, Tung AK, Kitsuregawa M (2009) Keyword search in spatial databases: Towards searching by document. In: ICDE. IEEE, pp 688–699Google Scholar
  37. 37.
    Zhang D, Ooi BC, Tung AK (2010) Locating mapped resources in web 2.0. In: ICDE. IEEE, pp 521–532Google Scholar
  38. 38.
    Zhao S, Cheng X, Su S, Shuang K (2017) Popularity-aware collective keyword queries in road networks. GeoInformatica 21, pp 1–34Google Scholar
  39. 39.
    Zhong R, Li G, Tan KL, Zhou L, Gong Z (2015) G-tree: an efficient and scalable index for spatial search on road networks. TKDE 27(8):2175–2189Google Scholar
  40. 40.
    Zhu L, Jing Y, Sun W, Mao D, Liu P (2010) Voronoi-based aggregate nearest neighbor query processing in road networks. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, pp 518–521Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2017

Authors and Affiliations

  • Pengfei Zhang
    • 1
  • Huaizhong Lin
    • 1
  • Yunjun Gao
    • 1
  • Dongming Lu
    • 1
  1. 1.College of Computer Science and TechnologyZhejiang UniversityHangzhouChina

Personalised recommendations