{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:02:41Z","timestamp":1725901361298},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374869"},{"type":"electronic","value":"9783642374876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37487-6_13","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T03:55:02Z","timestamp":1366170902000},"page":"146-160","source":"Crossref","is-referenced-by-count":11,"title":["OptRegion: Finding Optimal Region for Bichromatic Reverse Nearest Neighbors"],"prefix":"10.1007","author":[{"given":"Huaizhong","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"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","reference":[{"issue":"6","key":"13_CR1","doi-asserted-by":"publisher","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.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. JACM\u00a045(6), 891\u2013923 (1998)","journal-title":"JACM"},{"key":"13_CR2","unstructured":"Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn., pp. 32\u201355. Springer (2009)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bernecker, T., Emrich, T., Kriegel, H.-P., Renz, M., Zankl, S., Z\u00fcfle, A.: Efficient probabilistic reverse nearest neighbor query processing on uncertain data. In: VLDB, pp. 669\u2013680 (2011)","DOI":"10.14778\/2021017.2021024"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cheema, M.-A., Zhang, W., Lin, X., Zhang, Y., Li, X.: Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. In: VLDB, vol.\u00a021(1), pp. 69\u201395 (2012)","DOI":"10.1007\/s00778-011-0235-9"},{"key":"13_CR5","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Langerman, S., Seara, C., Ventura, I.: Reverse facility location problems. In: CCCG (2005)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","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, J.M., Langerman, S., Seara, C., Ventura, I.: Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Oper. Res.\u00a0202(1), 99\u2013106 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Friedman, J.-H., Bentley, J.-L., Finkel, R.-A.: An algorithm for finding best matches in logarithmic expected time. ACM TOMS, 209\u2013226 (1977)","DOI":"10.1145\/355744.355745"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B.H., Chen, G., Li, Q., Guo, X.F.: Continuous visible nearest neighbor query processing in spatial databases. In: VLDB, vol.\u00a020(3), pp. 371\u2013396 (2011)","DOI":"10.1007\/s00778-010-0200-z"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Korn, F., Ukrishnan, S.-M.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201\u2013212 (2000)","DOI":"10.1145\/335191.335415"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kang, J.-M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.H.: Continuou evaluation of monochromatic and bichromatic reverse nearest neighbors. In: ICDE, pp. 781\u2013790 (2007)","DOI":"10.1109\/ICDE.2007.367926"},{"key":"13_CR11","unstructured":"Liu, Y.-B., Wong, R.-C., Wang, K., Li, Z.-J., Chen, C.: A New Approach for Maximizing Bichromatic Reverse Nearest Neighbor Search. In: KAIS (to appear)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Singh, A., Ferhatosmanoglu, H., Tosun, A.: High Dimensional Reverse Nearest Neighbor Queries. In: CIKM, pp. 91\u201398 (2003)","DOI":"10.1145\/956863.956882"},{"key":"13_CR13","unstructured":"Stanoi, I., Agrawald, D.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD DMKD, pp. 44\u201353 (2000)"},{"key":"13_CR14","volume-title":"Data Structures and Algorithems","author":"R. Sedgewick","year":"1983","unstructured":"Sedgewick, R., Brown, M.H.: Data Structures and Algorithems, 1st edn. Addison-Wesley, Balanced Trees (1983)","edition":"1"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Shang, S., Yuan, B., Deng, K., Xie, K., Zhou, X.: Find the most accessible locations: reverse path nearest neighbor query in road networks. In: ACM GIS, pp. 181\u2013190 (2011)","DOI":"10.1145\/2093973.2093999"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Lian, X.: Reverse KNN search in arbitrary dimensionality. In: VLDB, pp. 744\u2013755 (2004)","DOI":"10.1016\/B978-012088469-8\/50066-8"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Wong, R.-C., Tamer \u00d6zsu, M., Fu, A.-W., Yu, P.-S., Liu, L., Liu, Y.: Maximizing bichromatic reverse nearest neighbor for Lp-norm in two- and three-dimensional space. In: VLDB, pp. 893\u2013919 (2011)","DOI":"10.1007\/s00778-011-0230-1"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Wong, R.-C., \u00d6zsu, M.T., Yu, P.-S., Fu, A.-W., Liu, L.: Efficient method for maximizing bichromatic reverse nearest neighbor. In: VLDB, pp. 1126\u20131137 (2009)","DOI":"10.14778\/1687627.1687754"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Wu, W., Li, X., Lee, M.-L.: Wynne Hsu: MaxFirst for MaxBRkNN. In: ICDE, pp. 828\u2013839 (2011)","DOI":"10.1109\/ICDE.2011.5767892"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37487-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T07:35:16Z","timestamp":1557646516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37487-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374869","9783642374876"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37487-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}