{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:02Z","timestamp":1759683722726},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T00:00:00Z","timestamp":1514505600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Program on Key Basic Research Project","award":["No.2012CB725305"],"award-info":[{"award-number":["No.2012CB725305"]}]},{"name":"NSFC Grant","award":["No.61428204"],"award-info":[{"award-number":["No.61428204"]}]},{"name":"Scientific Innovation Act of STCSM","award":["No.13511504200 and No.15JC1402400"],"award-info":[{"award-number":["No.13511504200 and No.15JC1402400"]}]},{"name":"National Science and Technology Supporting plan","award":["No.2015BAH45F01"],"award-info":[{"award-number":["No.2015BAH45F01"]}]},{"name":"The public key plan of Zhejiang Province","award":["No.2014C23005"],"award-info":[{"award-number":["No.2014C23005"]}]},{"name":"The cultural relic protection science and technology project of Zhejiang Province"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10707-017-0315-0","type":"journal-article","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T06:49:36Z","timestamp":1514530176000},"page":"237-268","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Aggregate keyword nearest neighbor queries on road networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Pengfei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Huaizhong","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Dongming","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,29]]},"reference":[{"issue":"25","key":"315_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.5120\/16754-7073","volume":"95","author":"MR Abbasifard","year":"2014","unstructured":"Abbasifard MR, Ghahremani B, Naderi H (2014) A survey on nearest neighbor search methods. International Journal of Computer Applications 95(25):39\u201352","journal-title":"International Journal of Computer Applications"},{"key":"315_CR2","doi-asserted-by":"crossref","unstructured":"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 47","DOI":"10.1145\/2996913.2996994"},{"key":"315_CR3","doi-asserted-by":"crossref","unstructured":"Bao J, Liu X, Zhou R, Wang B (2016) Keyword-aware optimal location query in road network. In: WAIM. Springer, pp 164\u2013177","DOI":"10.1007\/978-3-319-39937-9_13"},{"key":"315_CR4","doi-asserted-by":"crossref","unstructured":"Cao X, Cong G, Jensen CS, Ooi BC (2011) Collective spatial keyword querying. In: SIGMOD. ACM, pp 373\u2013384","DOI":"10.1145\/1989323.1989363"},{"issue":"2","key":"315_CR5","first-page":"13","volume":"40","author":"X Cao","year":"2015","unstructured":"Cao X, Cong G, Guo T, Jensen CS, Ooi BC (2015) Efficient processing of spatial group keyword queries. TODS 40(2):13","journal-title":"TODS"},{"key":"315_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013433","DOI":"10.1145\/2424321.2424382"},{"key":"315_CR7","doi-asserted-by":"crossref","unstructured":"Choi DW, Pei J, Lin X (2016) Finding the minimum spatial keyword cover. In: ICDE. IEEE, pp 685\u2013696","DOI":"10.1109\/ICDE.2016.7498281"},{"issue":"2","key":"315_CR8","first-page":"295","volume":"24","author":"K Deng","year":"2012","unstructured":"Deng K, Sadiq S, Zhou X, Xu H, Fung GPC, Lu Y (2012) On group nearest group query processing. TKDE 24(2):295\u2013308","journal-title":"TKDE"},{"issue":"1","key":"315_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10707-011-0149-0","volume":"17","author":"HG Elmongui","year":"2013","unstructured":"Elmongui HG, Mokbel MF, Aref WG (2013) Continuous aggregate nearest neighbor queries. GeoInformatica 17(1):63\u201395","journal-title":"GeoInformatica"},{"issue":"5","key":"315_CR10","first-page":"1205","volume":"27","author":"Y Gao","year":"2015","unstructured":"Gao Y, Qin X, Zheng B, Chen G (2015) Efficient reverse top-k boolean spatial keyword queries on road networks. TKDE 27(5):1205\u20131218","journal-title":"TKDE"},{"issue":"2","key":"315_CR11","first-page":"469","volume":"17","author":"Y Gao","year":"2016","unstructured":"Gao Y, Zhao J, Zheng B, Chen G (2016) Efficient collective spatial keyword query processing on road networks. TITS 17(2):469\u2013480","journal-title":"TITS"},{"key":"315_CR12","doi-asserted-by":"crossref","unstructured":"Guo T, Cao X, Cong G (2015) Efficient algorithms for answering the m-closest keywords query. In: SIGMOD. ACM, pp 405\u2013418","DOI":"10.1145\/2723372.2723723"},{"key":"315_CR13","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching, vol 14. ACM","DOI":"10.1145\/602259.602266"},{"issue":"12","key":"315_CR14","first-page":"3258","volume":"27","author":"ME Houle","year":"2015","unstructured":"Houle ME, Ma X, Oria V (2015) Effective and efficient algorithms for flexible aggregate similarity search in high dimensional spaces. TKDE 27(12):3258\u20133273","journal-title":"TKDE"},{"key":"315_CR15","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning. In: Proceedings of the 1995 ACM\/IEEE conference on Supercomputing. ACM, p 29","DOI":"10.1145\/224170.224229"},{"issue":"3","key":"315_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s00778-015-0418-x","volume":"25","author":"F Li","year":"2016","unstructured":"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\u2013338","journal-title":"VLDB J"},{"key":"315_CR17","doi-asserted-by":"crossref","unstructured":"Li M, Chen L, Cong G, Gu Y, Yu G (2016) Efficient processing of location-aware group preference queries. In: CIKM. ACM, pp 559\u2013568","DOI":"10.1145\/2983323.2983757"},{"key":"315_CR18","doi-asserted-by":"crossref","unstructured":"Li Y, Li F, Yi K, Yao B, Wang M (2011) Flexible aggregate similarity search. In: SIGMOD. ACM, pp 1009\u20131020","DOI":"10.1145\/1989323.1989429"},{"key":"315_CR19","doi-asserted-by":"crossref","unstructured":"Li Z, Xu H, Lu Y, Qian A (2010) Aggregate nearest keyword search in spatial databases. In: APWEB. IEEE, pp 15\u201321","DOI":"10.1109\/APWeb.2010.25"},{"key":"315_CR20","doi-asserted-by":"crossref","unstructured":"Long C, Wong RCW, Wang K, Fu AWC (2013) Collective spatial keyword queries: a distance owner-driven approach. In: SIGMOD. ACM, pp 689\u2013700","DOI":"10.1145\/2463676.2465275"},{"key":"315_CR21","doi-asserted-by":"crossref","unstructured":"Luo Y, Chen H, Furuse K, Ohbo N (2007) Efficient methods in finding aggregate nearest neighbor by projection-based filtering. ICCSA pp 821\u2013833","DOI":"10.1007\/978-3-540-74484-9_70"},{"key":"315_CR22","doi-asserted-by":"crossref","unstructured":"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 48","DOI":"10.4108\/infoscale.2007.900"},{"key":"315_CR23","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: ICDE. IEEE, pp 301\u2013312"},{"issue":"2","key":"315_CR24","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. TODS 30(2):529\u2013576","journal-title":"TODS"},{"key":"315_CR25","doi-asserted-by":"crossref","unstructured":"Rocha-Junior JB, N\u00f8rv\u00e5g K (2012) Top-k spatial keyword queries on road networks. In: Proceedings of the 15th international conference on extending database technology. ACM, pp 168\u2013179","DOI":"10.1145\/2247596.2247617"},{"key":"315_CR26","doi-asserted-by":"crossref","unstructured":"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\u201322","DOI":"10.1145\/2834126.2834819"},{"issue":"1","key":"315_CR27","first-page":"102","volume":"9","author":"S Shekhar","year":"1997","unstructured":"Shekhar S, Liu DR (1997) Ccam: a connectivity-clustered access method for networks and network computations. TKDE 9(1):102\u2013119","journal-title":"TKDE"},{"issue":"3","key":"315_CR28","first-page":"741","volume":"28","author":"V Singh","year":"2016","unstructured":"Singh V, Zong B, Singh AK (2016) Nearest keyword set search in multi-dimensional datasets. TKDE 28(3):741\u2013755","journal-title":"TKDE"},{"key":"315_CR29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ipl.2016.10.008","volume":"118","author":"S Su","year":"2017","unstructured":"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\u201390","journal-title":"Inf Process Lett"},{"key":"315_CR30","doi-asserted-by":"crossref","unstructured":"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\u20132248","DOI":"10.1145\/2505515.2505738"},{"key":"315_CR31","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.ins.2015.03.028","volume":"310","author":"W Sun","year":"2015","unstructured":"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\u201368","journal-title":"Inform Sci"},{"issue":"4","key":"315_CR32","first-page":"781","volume":"30","author":"WW Sun","year":"2015","unstructured":"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\u2013798","journal-title":"JCST"},{"key":"315_CR33","doi-asserted-by":"crossref","unstructured":"Yan D, Zhao Z, Ng W (2011) Efficient algorithms for finding optimal meeting point on road networks. Proceedings of the VLDB Endowment 4(11)","DOI":"10.14778\/3402707.3402734"},{"issue":"2","key":"315_CR34","first-page":"319","volume":"42","author":"D Yan","year":"2015","unstructured":"Yan D, Zhao Z, Ng W (2015) Efficient processing of optimal meeting point queries in euclidean space and road networks. KIS 42(2):319\u2013351","journal-title":"KIS"},{"issue":"6","key":"315_CR35","first-page":"820","volume":"17","author":"ML Yiu","year":"2005","unstructured":"Yiu ML, Mamoulis N, Papadias D (2005) Aggregate nearest neighbor queries in road networks. TKDE 17(6):820\u2013833","journal-title":"TKDE"},{"key":"315_CR36","doi-asserted-by":"crossref","unstructured":"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\u2013699","DOI":"10.1109\/ICDE.2009.77"},{"key":"315_CR37","doi-asserted-by":"crossref","unstructured":"Zhang D, Ooi BC, Tung AK (2010) Locating mapped resources in web 2.0. In: ICDE. IEEE, pp 521\u2013532","DOI":"10.1109\/ICDE.2010.5447897"},{"key":"315_CR38","doi-asserted-by":"crossref","unstructured":"Zhao S, Cheng X, Su S, Shuang K (2017) Popularity-aware collective keyword queries in road networks. GeoInformatica 21, pp 1\u201334","DOI":"10.1007\/s10707-017-0299-9"},{"issue":"8","key":"315_CR39","first-page":"2175","volume":"27","author":"R Zhong","year":"2015","unstructured":"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\u20132189","journal-title":"TKDE"},{"key":"315_CR40","doi-asserted-by":"crossref","unstructured":"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\u2013521","DOI":"10.1145\/1869790.1869876"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-017-0315-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-017-0315-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-017-0315-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,25]],"date-time":"2020-10-25T01:24:57Z","timestamp":1603589097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-017-0315-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,29]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["315"],"URL":"https:\/\/doi.org\/10.1007\/s10707-017-0315-0","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,29]]}}}