{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:40:06Z","timestamp":1725673206531},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642292521"},{"type":"electronic","value":"9783642292538"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29253-8_6","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T04:38:38Z","timestamp":1333600718000},"page":"60-72","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Algorithm for Arbitrary Reverse Furthest Neighbor Queries"],"prefix":"10.1007","author":[{"given":"Jianquan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazutaka","family":"Furuse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Kitagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kr\u00f6ger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In: SIGMOD, pp. 515\u2013526 (2006)","DOI":"10.1145\/1142473.1142531"},{"issue":"1-3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H.K. Ahn","year":"2004","unstructured":"Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M.J., van Oostrum, R.: Competitive facility location: the voronoi game. Theor. Comput. Sci.\u00a0310(1-3), 457\u2013467 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Potamias, M., Papapetrou, P., Kollios, G.: Nearest neighbor retrieval using distance-based hashing. In: ICDE, pp. 327\u2013336 (2008)","DOI":"10.1109\/ICDE.2008.4497441"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01901195","volume":"3","author":"B.K. Bhattacharya","year":"1988","unstructured":"Bhattacharya, B.K., Toussaint, G.T.: Fast algorithms for computing the diameter of a finite planar set. The Visual Computer\u00a03(6), 379\u2013388 (1988)","journal-title":"The Visual Computer"},{"issue":"1","key":"6_CR5","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. European Journal of Operational Research\u00a0202(1), 99\u2013106 (2010)","journal-title":"European Journal of Operational Research"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-03348-3_10","volume-title":"Advanced Data Mining and Applications","author":"H. Chen","year":"2009","unstructured":"Chen, H., Liu, J., Furuse, K., Yu, J.X., Ohbo, N.: Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol.\u00a05678, pp. 67\u201378. Springer, Heidelberg (2009)"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10115-010-0303-2","volume":"27","author":"H. Chen","year":"2011","unstructured":"Chen, H., Liu, J., Furuse, K., Yu, J.X., Ohbo, N.: Indexing expensive functions for efficient multi-dimensional similarity search. Knowl. Inf. Syst.\u00a027(2), 165\u2013192 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1287\/opre.1040.0175","volume":"53","author":"A. Dasci","year":"2005","unstructured":"Dasci, A., Laporte, G.: A continuous model for multistore competitive location. Operations Research\u00a053(2), 263\u2013280 (2005)","journal-title":"Operations Research"},{"issue":"1-4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"T.S. Hale","year":"2003","unstructured":"Hale, T.S., Moberg, C.R.: Location science research: A review. Annals OR\u00a0123(1-4), 21\u201335 (2003)","journal-title":"Annals OR"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201\u2013212 (2000)","DOI":"10.1145\/335191.335415"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Similarity search in arbitrary subspaces under lp-norm. In: ICDE, pp. 317\u2013326 (2008)","DOI":"10.1109\/ICDE.2008.4497440"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-15251-1_34","volume-title":"Database and Expert Systems Applications","author":"J. Liu","year":"2010","unstructured":"Liu, J., Chen, H., Furuse, K., Kitagawa, H.: An Efficient Algorithm for Reverse Furthest Neighbors Query with Metric Index. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part II. LNCS, vol.\u00a06262, pp. 437\u2013451. Springer, Heidelberg (2010)"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0377-2217(00)00169-7","volume":"129","author":"F. Plastria","year":"2001","unstructured":"Plastria, F.: Static competitive facility location: An overview of optimisation approaches. European Journal of Operational Research\u00a0129(3), 461\u2013470 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.cor.2006.05.006","volume":"35","author":"F. Plastria","year":"2008","unstructured":"Plastria, F., Vanhaverbeke, L.: Discrete models for competitive location with foresight. Computers & OR\u00a035(3), 683\u2013700 (2008)","journal-title":"Computers & OR"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71\u201379 (1995)","DOI":"10.1145\/568271.223794"},{"key":"6_CR16","unstructured":"Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99\u2013108 (2001)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00778-005-0168-2","volume":"16","author":"Y. Tao","year":"2007","unstructured":"Tao, Y., Papadias, D., Lian, X., Xiao, X.: Multidimensional reverse knn search. VLDB J.\u00a016(3), 293\u2013316 (2007)","journal-title":"VLDB J."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"issue":"1","key":"6_CR19","first-page":"1056","volume":"1","author":"W. Wu","year":"2008","unstructured":"Wu, W., Yang, F., Chan, C.Y., Tan, K.L.: Finch: evaluating reverse k-nearest-neighbor queries on location data. PVLDB\u00a01(1), 1056\u20131067 (2008)","journal-title":"PVLDB"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Yao, B., Li, F., Kumar, P.: Reverse furthest neighbors in spatial databases. In: ICDE, pp. 664\u2013675 (2009)","DOI":"10.1109\/ICDE.2009.62"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29253-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:33:42Z","timestamp":1620113622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29253-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642292521","9783642292538"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29253-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}