{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T03:51:05Z","timestamp":1763092265154},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642410611"},{"type":"electronic","value":"9783642410628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41062-8_30","type":"book-chapter","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T00:34:35Z","timestamp":1377822875000},"page":"300-311","source":"Crossref","is-referenced-by-count":6,"title":["(Very) Fast (All) k-Nearest Neighbors in Metric and Non Metric Spaces without Indexing"],"prefix":"10.1007","author":[{"given":"Natalia","family":"Miranda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Fabiana","family":"Piccoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol.\u00a032. Springer (2006)","DOI":"10.1007\/0-387-29151-2"},{"key":"30_CR2","series-title":"The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H. Samet","year":"2005","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling. Morgan Kaufmann Publishers Inc., San Francisco (2005)"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.: Searching in metric spaces. ACM Comput.\u00a0Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput.\u00a0Surv."},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S1570-8667(03)00067-4","volume":"2","author":"B. Benjamin","year":"2004","unstructured":"Benjamin, B., Navarro, G.: Probabilistic proximity searching algorithms based on compact partitions. Discrete Algorithms\u00a02(1), 115\u2013134 (2004)","journal-title":"Discrete Algorithms"},{"key":"30_CR5","unstructured":"Kirk, D., Hwu, W.: Programming Massively Parallel Processors, A Hands on Approach. Elsevier, Morgan Kaufmann (2010)"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Owens, J., Houston, M., Luebke, D., Green, S., Stone, J., Phillips, J.: GPU Computing, pp. 879\u2013899. IEEE (2008)","DOI":"10.1109\/JPROC.2008.917757"},{"key":"30_CR7","unstructured":"NVIDIA. Nvidia cuda compute unified device architecture, programming guide version 4.2. In: NVIDIA (2012)"},{"key":"30_CR8","unstructured":"Barrientos, R., Gomez, J., Tenllado, C., Prieto, M.: Heap based k-nearest neighbor search on gpus. In: XXI Jornadas de Paralelismo, pp. 559\u2013566 (September 2010)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. In: CVPR Workshop on Computer Vision on GPU (CVGPU), Anchorage, Alaska, USA (June 2008)","DOI":"10.1109\/CVPRW.2008.4563100"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: k-nearest neighbor search: fast GPU-based implementations and application to high-dimensional feature matching. In: IEEE International Conference on Image Processing, Hong Kong (September 2010)","DOI":"10.1109\/ICIP.2010.5654017"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Kato, K., Hosino, T.: Solving k-nearest neighbor problem on multiple graphics processors. In: ACM (ed.) 2010 10th IEEE\/ACM International Conference on Cluster, Cloud and Grid Computing, CCGRID, pp. 769\u2013773 (2010)","DOI":"10.1109\/CCGRID.2010.47"},{"key":"30_CR12","unstructured":"Kuang, Q., Zhao, L.: A practical gpu based knn algorithm. In: International Symposium on Computer Science and Computational Technology (ISC-SCT), pp. 151\u2013155 (2009)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Liang, S., Liu, Y., Wang, C., Jian, L.: Design and evaluation of a parallel k-nearest neighbor algorithm on CUDA-enabled GPU. In: IEEE 2nd Symposium on Web Society (SWS), p. 53 (2010)","DOI":"10.1109\/SWS.2010.5607480"},{"issue":"1-3","key":"30_CR14","first-page":"161","volume":"16","author":"T. Rozen","year":"2008","unstructured":"Rozen, T., Boryczko, K., Alda, W.: Gpu bucket sort algorithm with applications to nearest-neighbour search. Journal of WSCG\u00a016(1-3), 161\u2013167 (2008)","journal-title":"Journal of WSCG"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Barrientos, R., Gomez, J., Tenllado, C., Prieto, M.: Query processing in metric spaces using gpus. In: XXII Jornadas de Paralelismo (2011)","DOI":"10.1007\/978-3-642-23400-2_35"},{"key":"30_CR16","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":"R.J. 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.\u00a06852, pp. 380\u2013392. Springer, Heidelberg (2011)"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, K., Hou, Q., Wang, R., Guo, B.: Real-time kd-tree construction on graphics hardware. In: ACM SIGGRAPH Asia, Papers, SIGGRAPH Asia 2008, pp. 126:1\u2013126:11. ACM, New York (2008)","DOI":"10.1145\/1457515.1409079"},{"key":"30_CR18","unstructured":"Brown, S., Snoeyink, J.: Gpu nearest neighbors using a minimal kd-tree. In: Second Workshop on Massive Data Algorithmics (MASSIVE 2010), Snowbird, Utah, USA (June 2010)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-04667-4_20","volume-title":"Computer Vision Systems","author":"D. Qiu","year":"2009","unstructured":"Qiu, D., May, S., N\u00fcchter, A.: Gpu-accelerated nearest neighbor search for 3d registration. In: Fritz, M., Schiele, B., Piater, J.H. (eds.) ICVS 2009. LNCS, vol.\u00a05815, pp. 194\u2013203. Springer, Heidelberg (2009)"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Djinevski, S.R.L., Gusev, M.: Superlinear speedup for matrix multiplication in gpu devices. In: ICT Innovations 2012, pp. 285\u2013294 (2013)","DOI":"10.1007\/978-3-642-37169-1_28"},{"issue":"1","key":"30_CR21","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G. Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. The Very Large Databases Journal (VLDBJ)\u00a011(1), 28\u201346 (2002)","journal-title":"The Very Large Databases Journal (VLDBJ)"},{"key":"30_CR22","unstructured":"Chavez, E., Ludue\u00f1a, V., Reyes, N., Roggero, P.: Faster proximity searching with the distal sat (2012) (submitted, draft)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41062-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T20:30:40Z","timestamp":1558038640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41062-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642410611","9783642410628"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41062-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}