{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:18Z","timestamp":1740122238503,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T00:00:00Z","timestamp":1445212800000},"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":["Geoinformatica"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10707-015-0239-5","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T00:18:09Z","timestamp":1445213889000},"page":"351-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Finding optimal region for bichromatic reverse nearest neighbor in two- and three-dimensional spaces"],"prefix":"10.1007","volume":"20","author":[{"given":"Huaizhong","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5496-9891","authenticated-orcid":false,"given":"Fangshu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,19]]},"reference":[{"issue":"6","key":"239_CR1","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount D-M, Netanyahu N-S, Silverman R, Wu A-Y (1998) An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. JACM 45(6):891\u2013923","journal-title":"JACM"},{"key":"239_CR2","unstructured":"Berg M, Cheong O, Kreveld M, Overmars M (2009) Computational geometry: algorithms and applications. [M]. 3rd edn. Springer, p 32\u201355"},{"key":"239_CR3","doi-asserted-by":"crossref","unstructured":"Bernecker T, Emrich T, Kriegel H-P, Renz M, Zankl S, Z\u00fcfle A (2011) Efficient probabilistic reverse nearest neighbor query processing on uncertain data. VLDB:669\u2013680","DOI":"10.14778\/2021017.2021024"},{"key":"239_CR4","unstructured":"Cabello S, D\u00edaz-B\u00e1\u00f1ez JM, Langerman S, Seara C, Ventura I (2005) Reverse facility location problems. CCCG"},{"issue":"1","key":"239_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2009.04.021","volume":"202","author":"S Cabello","year":"2010","unstructured":"Cabello S, D\u00edaz-B\u00e1\u00f1ez JM, Langerman S, Seara C, Ventura I (2010) Facility location problems in the plane based on reverse nearest neighbor queries. Eur J Oper Res 202(1):99\u2013106","journal-title":"Eur J Oper Res"},{"issue":"1","key":"239_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00778-011-0235-9","volume":"21","author":"M-A Cheema","year":"2012","unstructured":"Cheema M-A, Zhang W, Lin X, Zhang Y, Li X (2012) Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. VLDB 21(1):69\u201395","journal-title":"VLDB"},{"issue":"4","key":"239_CR7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.4156\/jcit.vol7.issue4.15","volume":"7","author":"Z Chen","year":"2012","unstructured":"Chen Z, Wang L, Liu W (2012) Method for maximizing bichromatic reverse nearest neighbor in road networks. J Converg Inf Technol 7(4):125\u2013133","journal-title":"J Converg Inf Technol"},{"key":"239_CR8","author":"F Chen","year":"2015","unstructured":"Chen F, Lin H, Gao Y, Lu D (2015) Capacity constrained maximizing bichromatic reverse nearest neighbor search. Expert Syst Appl. doi: 10.1016\/j.eswa.2015.08.051","journal-title":"Expert Syst Appl"},{"key":"239_CR9","first-page":"1088","volume":"5","author":"D-W Choi","year":"2012","unstructured":"Choi D-W, Chung C-W, Tao Y (2012) A scalable algorithm for maximizing range sum in spatial databases. VLDB 5:1088\u20131099","journal-title":"VLDB"},{"key":"239_CR10","doi-asserted-by":"crossref","unstructured":"Du Y, Zhang D, Xia T (2005) The optimal-location query. SSTD:163\u2013180","DOI":"10.1007\/11535331_10"},{"key":"239_CR11","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J-H Friedman","year":"1977","unstructured":"Friedman J-H, Bentley J-L, Finkel R-A (1977) An algorithm for finding best matches in logarithmic expected time. ACM TOMS 3:209\u2013226","journal-title":"ACM TOMS"},{"issue":"3","key":"239_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00778-010-0200-z","volume":"20","author":"Y Gao","year":"2011","unstructured":"Gao Y, Zheng B, Chen G, Li Q, Guo X (2011) Continuous visible nearest neighbor query processing in spatial databases. VLDB 20(3):371\u2013396","journal-title":"VLDB"},{"issue":"2","key":"239_CR13","doi-asserted-by":"crossref","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, Banaei-Kashani F (2014) A comparative study of two approaches for supporting optimal network location queries. GeoInformatica 18(2):229\u2013251","journal-title":"GeoInformatica"},{"key":"239_CR14","unstructured":"Kang J-M, Mokbel MF, Shekhar S, Xia T, Zhang D (2007) Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. ICDE:781\u2013790"},{"key":"239_CR15","doi-asserted-by":"crossref","unstructured":"Korn F, Ukrishnan S-M (2000) Influence sets based on reverse nearest neighbor queries. SIGMOD:201\u2013212","DOI":"10.1145\/335191.335415"},{"key":"239_CR16","doi-asserted-by":"crossref","unstructured":"Lin H, Chen F, Gao Y, Lu D (2013) OptRegion: finding optimal region for bichromatic reverse nearest neighbors. DASFAA","DOI":"10.1007\/978-3-642-37487-6_13"},{"key":"239_CR17","doi-asserted-by":"crossref","unstructured":"Liu Y, Wong R-C, Wang K, Li Z-J, Chen C (2012) A new approach for maximizing bichromatic reverse nearest neighbor search. KAIS","DOI":"10.1007\/s10115-012-0527-4"},{"issue":"11","key":"239_CR18","doi-asserted-by":"crossref","first-page":"3128","DOI":"10.1016\/j.jpdc.2014.07.007","volume":"74","author":"T-P Nghiem","year":"2014","unstructured":"Nghiem T-P, Maulana K, Nguyen K, Green D et al (2014) Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks. J Parallel Distrib Comput 74(11):3128\u20133140","journal-title":"J Parallel Distrib Comput"},{"key":"239_CR19","unstructured":"Sedgewick R, Brown MH (1983) Data structures and algorithems. [M]. 1st edn. Addison-Wesley, Balanced Trees"},{"key":"239_CR20","unstructured":"Shang S, Yuan B, Deng K, Xie K, Zhou X (2011) Find the most accessible locations: reverse path nearest neighbor query in road networks. ACM GIS:181\u2013190"},{"key":"239_CR21","doi-asserted-by":"crossref","unstructured":"Singh A, Ferhatosmanoglu H, Tosun A (2003) High dimensional reverse nearest neighbor queries. CIKM:91-98","DOI":"10.1145\/956863.956882"},{"key":"239_CR22","unstructured":"Stanoi I, Agrawald D (2000) Reverse nearest neighbor queries for dynamic databases. ACM SIGMOD DMKD:44\u201353"},{"key":"239_CR23","unstructured":"Tao Y, Papadias D, Lian X (2004) Reverse KNN search in arbitrary dimensionality. VLDB:744-755"},{"key":"239_CR24","doi-asserted-by":"crossref","unstructured":"TaoY, Hu X, Choi D-W, Chung C-W (2013) Approximate MaxRS in spatial databases. PVLDB:1546\u20131557","DOI":"10.14778\/2536258.2536266"},{"issue":"4","key":"239_CR25","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/JSYST.2010.2047297","volume":"2","author":"Q Tran","year":"2010","unstructured":"Tran Q, Taniar D, Safar M (2010) Bichromatic reverse nearest-neighbor search in mobile systems. IEEE Syst J 4(2):230\u2013242","journal-title":"IEEE Syst J"},{"key":"239_CR26","unstructured":"Wong R-C, \u00d6zsu MT, Yu P-S, Fu A-W, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. VLDB:1126\u20131137"},{"key":"239_CR27","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s00778-011-0230-1","volume":"20","author":"R-C Wong","year":"2011","unstructured":"Wong R-C, \u00d6zsu MT, Fu A-W, Yu P-S, Liu L, Liu Y (2011) Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional space. VLDB 20:893\u2013919","journal-title":"VLDB"},{"key":"239_CR28","doi-asserted-by":"crossref","unstructured":"Yan D, Zhao Z, Ng W (2012) Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces. CIKM:942\u2013951","DOI":"10.1145\/2396761.2396880"},{"key":"239_CR29","doi-asserted-by":"crossref","unstructured":"Zhou Z, Wu W, Li X, Lee M-L, Hsu W (2011) MaxFirst for MaxBRkNN. ICDE:828\u2013839","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-015-0239-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-015-0239-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-015-0239-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T13:48:51Z","timestamp":1567259331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-015-0239-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,19]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s10707-015-0239-5","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2015,10,19]]}}}