{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T02:00:25Z","timestamp":1726106425500},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11704-020-9279-6","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T12:03:56Z","timestamp":1609761836000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal location query based on k nearest neighbours"],"prefix":"10.1007","volume":"15","author":[{"given":"Yubao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zitong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Raymond Chi-Wing","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Genan","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"9279_CR1","volume-title":"Reverse Facility Location Problems","author":"S Cabello","year":"2006","unstructured":"Cabello S, Diaz-Banez J M, Langerman S, Seara C, Ventura I. Reverse Facility Location Problems. Ljubljana: University of Ljubljana, Department of Mathematics, 2006"},{"key":"9279_CR2","unstructured":"Cardinal J, Langerman S. Min-max-min geometric facility location problems. In: Proceedings of European Workshop on Computational Geometry. 2006, 149\u2013152"},{"key":"9279_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"K R A Jakob","year":"1983","unstructured":"Jakob K R A, Pruzan P M. The simple plant location problem: survey and synthesis. European Journal of Operational Research, 1983, 12: 36\u201381","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9279_CR4","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/mnsc.29.4.498","volume":"29","author":"B C Tansel","year":"1983","unstructured":"Tansel B C, Francis R L, Lowe T J. Location on networks: a survey. Management Science, 1983, 29(4): 498\u2013511","journal-title":"Management Science"},{"key":"9279_CR5","doi-asserted-by":"crossref","unstructured":"Xiao X K, Yao B, Li F F. Optimal location queries in road network databases. In: Proceedings of IEEE International Conference on Data Engineering. 2011, 804\u2013815","DOI":"10.1109\/ICDE.2011.5767845"},{"key":"9279_CR6","volume-title":"Computational Geometry Algorithms and Applications","author":"M Van Kreveld","year":"2000","unstructured":"Van Kreveld M, Schwarzkopf O, de Berg M, Overmars M. Computational Geometry Algorithms and Applications. Heidelberg: Springer, 2000"},{"issue":"5","key":"9279_CR7","first-page":"697","volume":"23","author":"B Yao","year":"2014","unstructured":"Yao B, Xiao X K, Li F F, Wu Y F. Dynamic monitoring of optimal locations in road network databases. The VLDB Journal\u2014The International Journal on Very Large Data Bases, 2014, 23(5): 697\u2013720","journal-title":"The VLDB Journal\u2014The International Journal on Very Large Data Bases"},{"key":"9279_CR8","doi-asserted-by":"crossref","unstructured":"Qi J Z, Zhang R, Kulik L, Lin D, Xue Y. The min-dist location selection query. In: Proceedings of IEEE International Conference on Data Engineering. 2012, 366\u2013377","DOI":"10.1109\/ICDE.2012.45"},{"issue":"6","key":"9279_CR9","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1007\/s11280-013-0223-7","volume":"17","author":"J Z Qi","year":"2014","unstructured":"Qi J Z, Zhang R, Wang Y Q, Xue A Y, Yu G, Kulik L. The min-dist location selection and facility replacement queries. World Wide Web, 2014, 17(6): 1261\u20131293","journal-title":"World Wide Web"},{"key":"9279_CR10","doi-asserted-by":"crossref","unstructured":"Chen Z, Liu Y B, Wong R C W, Xiong J M, Mai G L, Long C. Efficient algorithms for optimal location queries in road networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2014, 123\u2013134","DOI":"10.1145\/2588555.2612172"},{"issue":"3","key":"9279_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2818179","volume":"40","author":"Z T Chen","year":"2015","unstructured":"Chen Z T, Liu Y B, Wong R C W, Xiong J M, Mai G L, Long C. Optimal location queries in road networks. ACM Transactions on Database Systems, 2015, 40(3): 17","journal-title":"ACM Transactions on Database Systems"},{"issue":"4","key":"9279_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s11280-015-0351-3","volume":"19","author":"Y Gu","year":"2016","unstructured":"Gu Y, Zhang H, Wang Z, Yu G. Efficient moving k nearest neighbor queries over line segment objects. World Wide Web, 2016, 19(4): 653\u2013677","journal-title":"World Wide Web"},{"key":"9279_CR13","first-page":"1","volume":"463","author":"J T Cui","year":"2018","unstructured":"Cui J T, Wang M, Li H, Cai Y. Place your next branch with MILE-RUN: min-dist location selection over user movement. Information Sciences, 2018, 463: 1\u201320","journal-title":"Information Sciences"},{"issue":"12","key":"9279_CR14","first-page":"10","volume":"3","author":"S Shokeen","year":"2016","unstructured":"Shokeen S. A study on fast food consumption pattern in India. International Journal of Research and Engineering, 2016, 3(12): 10\u201315","journal-title":"International Journal of Research and Engineering"},{"key":"9279_CR15","doi-asserted-by":"crossref","unstructured":"Chen Z T, Liu Y B, Fu A W C, Wong R C W, Dai G N. KOLQ in a road network. In: Proceedings of IEEE International Conference on Mobile Data Management. 2019, 81\u201390","DOI":"10.1109\/MDM.2019.00-71"},{"issue":"1","key":"9279_CR16","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.14778\/1687627.1687763","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H. Path oracles for spatial networks. Proceedings of the VLDB Endowment, 2009, 2(1): 1210\u20131221","journal-title":"Proceedings of the VLDB Endowment"},{"key":"9279_CR17","unstructured":"Hu H, Lee D L, Lee V. Distance indexing on road networks. In: Proceedings of the International Conference on Very Large Data Bases. 2006, 894\u2013905"},{"key":"9279_CR18","doi-asserted-by":"crossref","unstructured":"Samet H, Sankaranarayanan J, Alborzi H. Scalable network distance browsing in spatial databases. In: Proceedings of the 2008 ACM SIG-MOD International Conference on Management of Data. 2008, 43\u201354","DOI":"10.1145\/1376616.1376623"},{"key":"9279_CR19","unstructured":"Mouratidis K, Yiu M L, Papadias D, Mamoulis N. Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd International Conference on Very Large Data Bases. 2006, 43\u201354"},{"issue":"1","key":"9279_CR20","first-page":"69","volume":"21","author":"M A Cheema","year":"2012","unstructured":"Cheema M A, Zhang W, Lin X, Zhang Y, Li X F. Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. The VLDB Journal\u2014The International Journal on Very Large Data Bases, 2012, 21(1): 69\u201395","journal-title":"The VLDB Journal\u2014The International Journal on Very Large Data Bases"},{"issue":"11","key":"9279_CR21","doi-asserted-by":"publisher","first-page":"968","DOI":"10.14778\/3402707.3402734","volume":"4","author":"D Yan","year":"2011","unstructured":"Yan D, Zhao Z, Ng W. Efficient algorithms for finding optimal meeting point on road networks. Proceedings of the VLDB Endowment, 2011, 4(11): 968\u2013979","journal-title":"Proceedings of the VLDB Endowment"},{"key":"9279_CR22","unstructured":"Qi J Z, Xu Z H, Xue Y, Wen Z Y. A branch and bound method for mindist location selection queries. In: Proceedings of the 23rd Australasian Database Conference-Volume 124. 2012, 51\u201360"},{"key":"9279_CR23","doi-asserted-by":"crossref","unstructured":"Huang J, Wen Z Y, Qi J Z, Zhang R, Chen J, He Z. Top-k most influential locations selection. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management. 2011, 2377\u20132380","DOI":"10.1145\/2063576.2063971"},{"key":"9279_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2014.11.038","volume":"298","author":"Y J Gao","year":"2015","unstructured":"Gao Y J, Qi S Y, Chen L, Zheng B H, Li X H. On efficient k-optimal-location-selection query processing in metric spaces. Information Sciences, 2015, 298: 98\u2013117","journal-title":"Information Sciences"},{"issue":"1","key":"9279_CR25","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.14778\/1687627.1687754","volume":"2","author":"R C W Wong","year":"2009","unstructured":"Wong R C W, Ozsu M T, Fu A W C, Yu P S, Liu L. Efficient method for maximizing bichromatic reverse nearest neighbor. Proceedings of the VLDB Endowment, 2009, 2(1): 1126\u20131137","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"6","key":"9279_CR26","first-page":"893","volume":"20","author":"R C W Wong","year":"2011","unstructured":"Wong R C W, Ozsu M T, Fu A W C, Yu P S, Liu L, Liu Y B. Maximizing bichromatic reverse nearest neighbor for Lp-norm in two-and three-dimensional spaces. The VLDB Journal\u2014The International Journal on Very Large Data Bases, 2011, 20(6): 893\u2013919","journal-title":"The VLDB Journal\u2014The International Journal on Very Large Data Bases"},{"key":"9279_CR27","doi-asserted-by":"crossref","unstructured":"Yan D, Wong R C W, Ng W. Efficient methods for finding influential locations with adaptive grids. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management. 2011, 1475\u20131484","DOI":"10.1145\/2063576.2063788"},{"issue":"1","key":"9279_CR28","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10115-012-0527-4","volume":"36","author":"Y B Liu","year":"2013","unstructured":"Liu Y B, Wong R C W, Wang K, Li Z J, Chen C, Chen Z T. A new approach for maximizing bichromatic reverse nearest neighbor search. Knowledge and Information Systems, 2013, 36(1): 23\u201358","journal-title":"Knowledge and Information Systems"},{"key":"9279_CR29","doi-asserted-by":"crossref","unstructured":"Zhou Z N, Wu W, Li X H, Li M L, Hsu W. Maxfirst for maxbrknn. In: Proceedings of IEEE International Conference on Data Engineering. 2011, 828\u2013839","DOI":"10.1109\/ICDE.2011.5767892"},{"key":"9279_CR30","doi-asserted-by":"crossref","unstructured":"Liu R F, Fu A W C, Chen Z T, Huang Sl L, Liu Y B. Finding multiple new optimal locations in a road network. In: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2016, 1\u201310","DOI":"10.1145\/2996913.2996927"},{"issue":"2","key":"9279_CR31","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10707-013-0179-x","volume":"18","author":"P Ghaemi","year":"2014","unstructured":"Ghaemi P, Shahabi K, Wilson J P, Kashani F B. A comparative study of two approaches for supporting optimal network location queries. GeoInformatica, 2014, 18(2): 229\u2013251","journal-title":"GeoInformatica"},{"key":"9279_CR32","doi-asserted-by":"crossref","unstructured":"Gamper J, Bohlen M, Innerebner M. Scalable computation of isochrones with network expiration. In: Proceedings of International Conference on Scientific and Statistical Database Management. 2012, 526\u2013543","DOI":"10.1007\/978-3-642-31235-9_35"},{"key":"9279_CR33","doi-asserted-by":"crossref","unstructured":"Xu Z D, Jacobsen H A. Processing proximity relations in road networks. In: Proceedings of the ACM SIGMOD International Conference on Management of Data. 2010, 243\u2013254","DOI":"10.1145\/1807167.1807196"},{"key":"9279_CR34","doi-asserted-by":"crossref","unstructured":"Yilmaz E, Elbasi S, Ferhatosmanoglu H. Predicting optimal facility location without customer locations. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2017, 2121\u20132130","DOI":"10.1145\/3097983.3098198"},{"key":"9279_CR35","doi-asserted-by":"crossref","unstructured":"Du Y, Zhang D H, Xia T. The optimal-location query. In: Proceedings of International Symposium on Spatial and Temporal Databases. 2005, 163\u2013180","DOI":"10.1007\/11535331_10"},{"key":"9279_CR36","unstructured":"Zhang D H, Du Y, Xia T, Tao Y F. Progressive computation of the min-dist optimal-location query. In: Proceedings of the International Conference on Very Large Data Bases. 2006, 643\u2013654"},{"issue":"6","key":"9279_CR37","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1109\/TKDE.2005.87","volume":"17","author":"M L Yiu","year":"2005","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","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"9279_CR38","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1145\/1071610.1071616","volume":"30","author":"D Papadias","year":"2005","unstructured":"Papadias D, Tao Y F, Mouratidis K, Hui K. Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems, 2005, 30(2): 529\u2013576","journal-title":"ACM Transactions on Database Systems"},{"issue":"1","key":"9279_CR39","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10707-011-0149-0","volume":"17","author":"H G Elmongui","year":"2013","unstructured":"Elmongui H G, Mokbel M F, Aref W G. Continuous aggregate nearest neighbor queries. GeoInformatica, 2013, 17(1): 63\u201395","journal-title":"GeoInformatica"},{"issue":"2","key":"9279_CR40","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/335191.335415","volume":"29","author":"F Korn","year":"2000","unstructured":"Korn F, Muthukrishnan S. Influence sets based on reverse nearest neighbor queries. ACM Sigmod Record, 2000, 29(2): 201\u2013212","journal-title":"ACM Sigmod Record"},{"issue":"8","key":"9279_CR41","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1109\/TKDE.2011.50","volume":"23","author":"A Vlachou","year":"2011","unstructured":"Vlachou A, Doulkeridis C, Kotidis Y, Norvag K. Monochromatic and bichromatic reverse top-k queries. IEEE Transactions on Knowledge and Data Engineering, 2011, 23(8): 1215\u20131229","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"10","key":"9279_CR42","doi-asserted-by":"publisher","first-page":"669","DOI":"10.14778\/2021017.2021024","volume":"4","author":"T Bernecker","year":"2011","unstructured":"Bernecker T, Emrich T, Kriegel H P, Renz M, Zankl S, Zufle A. Efficient probabilistic reverse nearest neighbor query processing on uncertain data. Proceedings of the VLDB Endowment, 2011, 4(10): 669\u2013680","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"9279_CR43","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TKDE.2009.108","volume":"22","author":"M A Cheema","year":"2009","unstructured":"Cheema M A, Lin X, Wang W, Zhang W J, Pei J. Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Transactions on Knowledge and Data Engineering, 2009, 22(4): 550\u2013564","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9279_CR44","doi-asserted-by":"crossref","unstructured":"Xu L, Mai G L, Chen Z T, Liu Y B, Dai G N. MinSum based optimal location query in road networks. In: Proceedings of International Conference on Database Systems for Advanced Applications. 2017, 441\u2013457","DOI":"10.1007\/978-3-319-55699-4_27"},{"issue":"1","key":"9279_CR45","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E W Dijkstra","year":"1959","unstructured":"Dijkstra E W. A note on two problems in connexion with graphs. Numerische Mathematik, 1959, 1(1): 269\u2013271","journal-title":"Numerische Mathematik"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-9279-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-020-9279-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-020-9279-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T07:27:03Z","timestamp":1677482823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-020-9279-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9279"],"URL":"http:\/\/dx.doi.org\/10.1007\/s11704-020-9279-6","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"30 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152606"}}
