{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T03:10:09Z","timestamp":1748488209258,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11390-015-1560-z","type":"journal-article","created":{"date-parts":[[2015,7,8]],"date-time":"2015-07-08T08:51:22Z","timestamp":1436345482000},"page":"781-798","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Efficient Aggregate Nearest Neighbor Query Processing in Road Networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Wei-Wei","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Nan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun-Jun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Nan","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,8]]},"reference":[{"key":"1560_CR1","doi-asserted-by":"crossref","unstructured":"Yiu M L, Mamoulis N, Papadias D. Aggregate nearest neighbor queries in road networks. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 820\u2013833.","DOI":"10.1109\/TKDE.2005.87"},{"key":"1560_CR2","doi-asserted-by":"crossref","unstructured":"Kolahdouzan M R, Shahabi C. Voronoi-based k nearest neighbor search for spatial network databases. In Proc. the 30th VLDB, Aug. 31-Sept. 3, 2004, pp. 840\u2013851.","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"1560_CR3","doi-asserted-by":"crossref","unstructured":"Zhu L, Jing Y, Sun W, Mao D, Liu P. Voronoi-based aggregate nearest neighbor query processing in road networks. In Proc. the 18th ACM SIGSPATIAL GIS, Nov. 2010, pp. 518\u2013521.","DOI":"10.1145\/1869790.1869876"},{"key":"1560_CR4","doi-asserted-by":"crossref","unstructured":"Guttman A. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD, June 1984, pp. 47\u201357.","DOI":"10.1145\/602259.602266"},{"key":"1560_CR5","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In Proc. ACM SIGMOD, May 1995, pp. 71\u201379.","DOI":"10.1145\/223784.223794"},{"key":"1560_CR6","doi-asserted-by":"crossref","unstructured":"Cheung K L, Fu A W. Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record, 1998, 27(3): 16\u201321.","DOI":"10.1145\/290593.290596"},{"key":"1560_CR7","doi-asserted-by":"crossref","unstructured":"Hjaltason G, Samet H. Distance browsing in spatial databases. ACM Transactions on Database Systems, 1999, 24(2): 265\u2013318.","DOI":"10.1145\/320248.320255"},{"key":"1560_CR8","doi-asserted-by":"crossref","unstructured":"Papadopoulos A, Manolopoulos Y. Performance of nearest neighbor queries in R-trees. In Proc. the 6th ICDT, Jan. 1997, pp. 394\u2013408.","DOI":"10.1007\/3-540-62222-5_59"},{"key":"1560_CR9","doi-asserted-by":"crossref","unstructured":"Tao Y, Papadias D, Shen Q. Continuous nearest neighbor search. In Proc. the 28th VLDB, Aug. 2002, pp. 287\u2013298.","DOI":"10.1016\/B978-155860869-6\/50033-0"},{"key":"1560_CR10","doi-asserted-by":"crossref","unstructured":"Hu H, Lee D L. Range nearest-neighbor query. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(1): 78\u201391.","DOI":"10.1109\/TKDE.2006.15"},{"key":"1560_CR11","doi-asserted-by":"crossref","unstructured":"Gao Y, Zheng B. Continuous obstructed nearest neighbor queries in spatial databases. In Proc. ACM SIGMOD, June 29\u2013July 2, 2009, pp. 577\u2013590.","DOI":"10.1145\/1559845.1559906"},{"key":"1560_CR12","doi-asserted-by":"crossref","unstructured":"Tao Y, Yiu M L, Mamoulis N. Reverse nearest neighbor search in metric spaces. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(9): 1239\u20131252.","DOI":"10.1109\/TKDE.2006.148"},{"key":"1560_CR13","doi-asserted-by":"crossref","unstructured":"Nutanong S, Tanin E, Zhang R. Visible nearest neighbor querying. In Proc. the 12th DASFAA, Apr. 2007, pp. 876\u2013883.","DOI":"10.1007\/978-3-540-71703-4_73"},{"key":"1560_CR14","doi-asserted-by":"crossref","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Closest pair queries in spatial databases. In Proc. ACM SIGMOD, May 2000, pp. 189\u2013200.","DOI":"10.1145\/342009.335414"},{"key":"1560_CR15","doi-asserted-by":"crossref","unstructured":"Papadias D, Shen Q, Tao Y, Mouratidis K. Group nearest neighbor queries. In Proc. the 20th ICDE, Mar. 30\u2013Apr. 2, 2004, pp. 301\u2013312. Deviation (%)","DOI":"10.1145\/1071610.1071616"},{"key":"1560_CR16","doi-asserted-by":"crossref","unstructured":"Papadias D, Tao Y, Mouratidis K, Hui C K. Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems, 2005, 30(2): 529\u2013576.","DOI":"10.1145\/1071610.1071616"},{"key":"1560_CR17","doi-asserted-by":"crossref","unstructured":"Jensen C S, Kol\u00e1rvr J, Pedersen T B, Timko I. Nearest neighbor queries in road networks. In Proc. the 11th GIS, Nov. 2003, pp. 1\u20138.","DOI":"10.1145\/956676.956677"},{"key":"1560_CR18","doi-asserted-by":"crossref","unstructured":"Papadias D, Zhang J, Mamoulis N, Tao Y. Query processing in spatial network databases. In Proc. the 29th VLDB, Sept. 2003, pp. 802\u2013813.","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"1560_CR19","doi-asserted-by":"crossref","unstructured":"Huang X, Jensen C S, \u0160altenis S. The islands approach to nearest neighbor querying in spatial networks. In Proc. the 9th SSTD, Aug. 2005, pp. 73\u201390.","DOI":"10.1007\/11535331_5"},{"key":"1560_CR20","unstructured":"Kolahdouzan M R, Shahabi C. Continuous k-nearest neighbor queries in spatial network databases. In Proc. the 2nd STDBM, Aug. 2004, pp. 33\u201340."},{"key":"1560_CR21","doi-asserted-by":"crossref","unstructured":"Yiu M L, Papadias D, Mamoulis N, Tao Y. Reverse nearest neighbors in large graphs. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(4): 540\u2013553.","DOI":"10.1109\/TKDE.2006.1599391"},{"key":"1560_CR22","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan J, Alborzi H, Samet H. Distance join queries on spatial networks. In Proc. the 14th ACM GIS, Nov. 2006, pp. 211\u2013218.","DOI":"10.1145\/1183471.1183506"},{"key":"1560_CR23","doi-asserted-by":"crossref","unstructured":"Deng K, Zhou X, Shen H T. Multi-source skyline query processing in road networks. In Proc. the 23rd ICDE, Apr. 2007, pp. 796\u2013805.","DOI":"10.1109\/ICDE.2007.367925"},{"key":"1560_CR24","doi-asserted-by":"crossref","unstructured":"Yan D, Zhao Z, Ng W. Efficient algorithms for finding optimal meeting point on road networks. In Proc. the 37th VLDB, Aug. 29\u2013Sept. 3, 2011, pp. 968\u2013979.","DOI":"10.14778\/3402707.3402734"},{"key":"1560_CR25","doi-asserted-by":"crossref","unstructured":"Sharifzadeh M, Shahabi C, Kazemi L. Processing spatial skyline queries in both vector spaces and spatial network databases. ACM Transactions on Database Systems, 2009, 34(3): Article No. 14.","DOI":"10.1145\/1567274.1567276"},{"key":"1560_CR26","doi-asserted-by":"crossref","unstructured":"Qin L, Yu J X, Ding B, Ishikawa Y. Monitoring aggregate k-NN objects in road networks. In Proc. the 20th SSDBM, July 2008, pp. 168\u2013186.","DOI":"10.1007\/978-3-540-69497-7_13"},{"key":"1560_CR27","doi-asserted-by":"crossref","unstructured":"Elmongui H G, Mokbel M F, Aref W G. Continuous aggregate nearest neighbor queries. GeoInformatica, 2013, 17(1): 63\u201395.","DOI":"10.1007\/s10707-011-0149-0"},{"key":"1560_CR28","doi-asserted-by":"crossref","unstructured":"Li J, Yiu M L, Mamoulis N. Efficient notification of meeting points for moving groups via independent safe regions. In Proc. the 29th ICDE, Apr. 2013, pp. 422\u2013433.","DOI":"10.1109\/ICDE.2013.6544844"},{"key":"1560_CR29","doi-asserted-by":"crossref","unstructured":"Chen K, Sun W, Tu C, Chen C, Huang Y. Aggregate keyword routing in spatial database. In Proc. the 20th ACM SIGSPATIAL GIS, Nov. 2012, pp. 430\u2013433.","DOI":"10.1145\/2424321.2424382"},{"key":"1560_CR30","doi-asserted-by":"crossref","unstructured":"Hashem T, Kulik L, Zhang R. Privacy preserving group nearest neighbor queries. In Proc. the 13th EDBT, Mar. 2010, pp. 489\u2013500.","DOI":"10.1145\/1739041.1739100"},{"key":"1560_CR31","doi-asserted-by":"crossref","unstructured":"Lian X, Chen L. Probabilistic group nearest neighbor queries in uncertain databases. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(6): 809\u2013824.","DOI":"10.1109\/TKDE.2008.41"},{"key":"1560_CR32","doi-asserted-by":"crossref","unstructured":"Liu Z, Wang C, Wang J. Aggregate nearest neighbor queries in uncertain graphs. World Wide Web, 2014, 17(1): 161\u2013188.","DOI":"10.1007\/s11280-012-0200-6"},{"key":"1560_CR33","doi-asserted-by":"crossref","unstructured":"Hakimi S L, Labb\u00e9 M, Schmeichel E F. The Voronoi partition of a network and its implications in location theory. INFORMS Journal on Computing, 1992, 4(4): 412\u2013417.","DOI":"10.1287\/ijoc.4.4.412"},{"key":"1560_CR34","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng S H. On trip planning queries in spatial databases. In Proc. the 9th SSTD, Aug. 2005, pp. 273\u2013290.","DOI":"10.1007\/11535331_16"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1560-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-015-1560-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-015-1560-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T02:43:48Z","timestamp":1748486628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-015-1560-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1560"],"URL":"https:\/\/doi.org\/10.1007\/s11390-015-1560-z","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}