{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:38:23Z","timestamp":1709833103079},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,4,12]],"date-time":"2011-04-12T00:00:00Z","timestamp":1302566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s00778-011-0230-1","type":"journal-article","created":{"date-parts":[[2011,4,11]],"date-time":"2011-04-11T13:20:31Z","timestamp":1302528031000},"page":"893-919","source":"Crossref","is-referenced-by-count":27,"title":["Maximizing bichromatic reverse nearest neighbor for L p -norm in two- and three-dimensional spaces"],"prefix":"10.1007","volume":"20","author":[{"given":"Raymond Chi-Wing","family":"Wong","sequence":"first","affiliation":[]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Lian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yubao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,12]]},"reference":[{"key":"230_CR1","unstructured":"Amato, N.M., Goodrich, M., Ramos, E.A.: Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In: Proceedings of the 11th ACM-SIAM Symposium on Discreate Algorithms, pp. 705\u2013706 (2000)"},{"key":"230_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"1","key":"230_CR3","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., Diaz-Banex J.M., Langerman S., Seara C.: Facility location problems in the plane based on reverse nearest neighbor queries. Eur. J. Operat. Res. 202(1), 99\u2013106 (2010)","journal-title":"Eur. J. Operat. Res."},{"key":"230_CR4","unstructured":"Cabello, S., Diaz-Banez, J.M., Langerman, S., Seara, C., Ventura, I.: Reverse facility location problems. In: Canadian Conference on Computational Geometry, pp. 68\u201371 (2005)"},{"key":"230_CR5","unstructured":"Cardinal, J., Langerman, S.: Min-max-min geometric facility location problems. In: 22nd European Workshop on Computational Geometry (2006)"},{"key":"230_CR6","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0215051","volume":"15","author":"B. Chazelle","year":"1986","unstructured":"Chazelle B.: Filtering search: a new approach to query-answering. SIAM J. Comput. 15, 703\u2013724 (1986)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"230_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0019-9958(86)80030-4","volume":"68","author":"B. Chazelle","year":"1986","unstructured":"Chazelle B.: New upper bounds for neighbor searching. Inf. Control 68(1\u20133), 105\u2013124 (1986)","journal-title":"Inf. Control"},{"key":"230_CR8","unstructured":"Chiueh, T.: Content-based image indexing. In: VLDB (1994)"},{"key":"230_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg M., van Kreveld M., Overmars M., Schwarzkopf O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2000)"},{"key":"230_CR10","doi-asserted-by":"crossref","unstructured":"Du, Y., Zhang, D., Xia, T.: The optimal-location query. In: SSTD, pp. 163\u2013180 (2005)","DOI":"10.1007\/11535331_10"},{"key":"230_CR11","doi-asserted-by":"crossref","unstructured":"Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.: Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: Proceedings of the International Conference on Data Engineering, pp. 806\u2013815 (2007)","DOI":"10.1109\/ICDE.2007.367926"},{"key":"230_CR12","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 201\u2013212 (2000)","DOI":"10.1145\/335191.335415"},{"issue":"1","key":"230_CR13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J. Krarup","year":"1983","unstructured":"Krarup J., Pruzan P.M.: The simple plant location problem: survey and synthesis. Eur. J. Operat. Res. 12(1), 36\u201357 (1983)","journal-title":"Eur. J. Operat. Res."},{"issue":"3","key":"230_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1025153016110","volume":"7","author":"C. Shahabi","year":"2003","unstructured":"Shahabi C., Kolahdouzan M.R., Sharifzadeh M.: A road network embedding technique for k-nearest neighbor search in moving object databases. GeoInformatica 7(3), 255\u2013273 (2003)","journal-title":"GeoInformatica"},{"key":"230_CR15","unstructured":"Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: Proceedings of the International Conference on Very Data Bases (VLDB). (2001)"},{"issue":"4","key":"230_CR16","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"Tansel B.C., Francis R.L., Lowe T.: Location on networks: a survey. Manage. Sci. 29(4), 482\u2013497 (1983)","journal-title":"Manage. Sci."},{"issue":"3","key":"230_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10707-006-9828-7","volume":"10","author":"Y. Tao","year":"2006","unstructured":"Tao Y., Faloutsos C., Papadias D.: Spatial query estimation without the local uniformity assumption. GeoInformatica 10(3), 261\u2013293 (2006)","journal-title":"GeoInformatica"},{"key":"230_CR18","doi-asserted-by":"crossref","unstructured":"Yiu, L.H.U.M.L., Mouratidis, K., Mamoulis, N.: Capacity constrained assignment in spatial databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 15\u201328 (2008)","DOI":"10.1145\/1376616.1376621"},{"key":"230_CR19","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Ozsu, T., Fu, A.W.-C., Yu, P.S., Liu, L., Liu, Y.: Maximizing bichromatic reverse nearest neighbor for lp-norm in two- and three-dimensional spaces. In: http:\/\/www.cse.ust.hk\/~raywong\/paper\/maxRNNtechnicalReport.pdf (2011)","DOI":"10.1007\/s00778-011-0230-1"},{"key":"230_CR20","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Ozsu, T., Yu, P.S., Fu, A.W.-C.: Efficient method for maximizing bichromatic reverse nearest neighbor. In: Proceedings of the International Conference on Very Data Bases (VLDB). (2009)","DOI":"10.14778\/1687627.1687754"},{"key":"230_CR21","unstructured":"Wong, R.C.-W., Tao, Y., Fu, A.W.-C., Xiao, X.: On efficient spatial matching. In: Proceedings of the International Conference on Very Data Bases (VLDB), pp. 579\u2013590 (2007)"},{"key":"230_CR22","unstructured":"Xia, T., Zhang, D., Kanoulas, E., Du, Y.: On computing top-t most influential spatial sites. In: Proceedings of the International Conference on Very Data Bases (VLDB), pp. 946\u2013957 (2005)"},{"key":"230_CR23","unstructured":"Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: Proceedings of the International Conference on Very Data Bases (VLDB), pp. 643\u2013654 (2006)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0230-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-011-0230-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-011-0230-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T22:58:54Z","timestamp":1560121134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-011-0230-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,12]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s00778-011-0230-1","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,12]]}}}