{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:52:09Z","timestamp":1742953929557,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439838"},{"type":"electronic","value":"9783662439845"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43984-5_23","type":"book-chapter","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T12:57:50Z","timestamp":1404997070000},"page":"308-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Multiple Bichromatic Mutual Nearest Neighbor Queries with the GPU"],"prefix":"10.1007","author":[{"given":"Marta","family":"Fort","sequence":"first","affiliation":[]},{"given":"J. Antoni","family":"Sellar\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Achtert, E., B\u00f6hm, C., Kroger, P., Kunath, P., Pryakhin, A., Renz, M.: Efficient reverse k-nearest neighbor search in arbitrary metric spaces. SIGMOD (2006)","DOI":"10.1145\/1142473.1142531"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0167-7152(96)00213-1","volume":"35","author":"MR Brito","year":"1997","unstructured":"Brito, M.R., Chavez, E.L., Quiroz, A.J., Yukich, J.E.: Connectivity of the mutual k-nearest neighbor graph in clustering and outlier detection. Stat. Probab. Lett. 35(1), 33\u201342 (1997)","journal-title":"Stat. Probab. Lett."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-23400-2_35","volume-title":"Euro-Par 2011 Parallel Processing","author":"RJ Barrientos","year":"2011","unstructured":"Barrientos, R.J., G\u00f3mez, J.I., Tenllado, C., Matias, M.P., Marin, M.: kNN query processing in metric spaces using GPUs. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part I. LNCS, vol. 6852, pp. 380\u2013392. Springer, Heidelberg (2011)"},{"key":"23_CR4","unstructured":"Brown, S., Snoeyink, J.: Gpu nearest neighbors using a minimal kd-tree, In: Second Workshop on Massive Data Algorithmics, (MASSIVE) (2010)"},{"key":"23_CR5","unstructured":"Cayton, L.: A nearest neighbor data structure for Graphics Hardware. VLDB-ADMS pp. 1\u20136 (2010)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"KL Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. SIGMOD 27(3), 16\u201321 (1998)","journal-title":"SIGMOD"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.: Efficient evaluation of all-nearest-neighbor queries. ICDE pp. 1056\u20131065 (2007)","DOI":"10.1109\/ICDE.2007.368964"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0022-4359(94)90028-0","volume":"70","author":"T Drezner","year":"1994","unstructured":"Drezner, T.: Optimal continuous location of a retail facility, facility attractiveness, and market share: an interactive model. J. Retail. 70(1), 49\u201364 (1994)","journal-title":"J. Retail."},{"issue":"1\u20134","key":"23_CR9","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1020910021280","volume":"111","author":"T Drezner","year":"2002","unstructured":"Drezner, T., Drezner, Z.: Validating the Gravity-Based Competitive Location Model Using Inferred Attractiveness. Annals OR 111(1\u20134), 227\u2013237 (2002)","journal-title":"Annals OR"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.knosys.2013.03.013","volume":"47","author":"M Fort","year":"2013","unstructured":"Fort, M., Sellar\u00e8s, J.A.: Finding influential location regions based on reverse k-neighbor queries. Knowl.Based Syst. 47, 35\u201352 (2013)","journal-title":"Knowl.Based Syst."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Gao, Y., Chen, G., Li, Q., Zheng, B., Li, C.: Processing mutual nearest neighbor queries for moving object trajectories. In: Proc. 9th Int. Conf. on Mobile Data Management, pp. 116\u2013123 (2008)","DOI":"10.1109\/MDM.2008.17"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: k-nearest neighbor search: fast GPU-based implementation and application to high-dimensional feature matching. In: Proceedings IEEE 17th Int. Conf. on Image Processing (ICIP) pp. 3757\u20133760 (2010)","DOI":"10.1109\/ICIP.2010.5654017"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0031-3203(78)90018-3","volume":"10","author":"KC Gowda","year":"1978","unstructured":"Gowda, K.C., Krishna, G.: Agglomerative clustering using the concept of mutual nearest neighborhood. Pattern Recog. 10(2), 105\u2013112 (1978)","journal-title":"Pattern Recog."},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TIT.1979.1056066","volume":"25","author":"KC Gowda","year":"1979","unstructured":"Gowda, K.C., Krishna, G.: The condensed nearest neighbor rule using the concept of mutual nearest neighborhood. IEEE Trans. Inf. Theory 25(4), 488\u2013490 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Gao, Y., Zheng, B., Chen, G., Li, Q., Chen, C., Chen, G.: Efficient mutual nearest neighbor query processing for moving object trajectories, Information Sciences, 180(11), pp. 2176\u20132195 (2010)","DOI":"10.1016\/j.ins.2010.02.010"},{"issue":"8","key":"23_CR16","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.datak.2009.04.004","volume":"68","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Zheng, B., Chen, G., Li, Q.: On efficient mutual nearest neighbor query processing in spatial databases. Data Knowl. Eng. 68(8), 705\u2013727 (2009)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"23_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"GR Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265\u2013318 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/11731139_68","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W Jin","year":"2006","unstructured":"Jin, W., Tung, A.K.H., Han, J., Wang, W.: Ranking Outliers Using Symmetric Neighborhood Relationship. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 577\u2013593. Springer, Heidelberg (2006)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. SIGMOD (2000)","DOI":"10.1145\/342009.335415"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-41062-8_30","volume-title":"Similarity Search and Applications","author":"N Miranda","year":"2013","unstructured":"Miranda, N., Ch\u00e1vez, E., Piccoli, M.F., Reyes, N.: (Very) Fast (All) k-Nearest Neighbors in Metric and Non Metric Spaces without Indexing. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 300\u2013311. Springer, Heidelberg (2013)"},{"key":"23_CR21","unstructured":"Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets\u00a0in frequently updated databases. In: Proceedings 27th Int. Conf. on Very Large Data Bases (VLDB) pp. 99\u2013108 (2001)"},{"key":"23_CR22","unstructured":"Wong, R.C.-W., Tao, Y., Fu, A.W.C., Xiao, X.: On efficient spatial matching. In: Proceedings 33rd International Conference on Very Large Data Base, pp. 579\u2013590 (2007)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Wu, W., Yang, F., Chan, C.Y., Tan, K.: FINCH: evaluating reverse k-Nearest-Neighbor queries on location data. In Proceedings of VLDB 1(1), pp. 1056\u20131067 (2008)","DOI":"10.14778\/1453856.1453970"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Yao, B., Li, F., Kumar, P.: K-nearest neighbor queries and knn-joins in large relational databases (almost) for free. In Proceedings of ICDE 2010, pp. 4\u201315 (2010)","DOI":"10.1109\/ICDE.2010.5447837"},{"key":"23_CR25","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: Proceedings of 16th International Conference on Scientific and Statistical Database Management (SSDBM). pp. 297\u2013306 (2004)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43984-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T08:09:24Z","timestamp":1674547764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43984-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439838","9783662439845"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43984-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"11 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}