{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:34:14Z","timestamp":1725586454882},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219276"},{"type":"electronic","value":"9783642219283"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21928-3_45","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T17:48:53Z","timestamp":1308332933000},"page":"615-629","source":"Crossref","is-referenced-by-count":5,"title":["A GPU-Based Implementation for Range Queries on Spaghettis Data Structure"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Uribe-Paredes","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Valero-Lara","sequence":"additional","affiliation":[]},{"given":"Enrique","family":"Arias","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 L.","family":"S\u00e1nchez","sequence":"additional","affiliation":[]},{"given":"Diego","family":"Cazorla","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"45_CR1","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.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Transactions on Software Engineering\u00a09(5) (1983)","DOI":"10.1109\/TSE.1983.235263"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040, 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"key":"45_CR4","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: The 23st International Conference on VLDB, pp. 426\u2013435 (1997)"},{"key":"45_CR5","first-page":"574","volume-title":"The 21st VLDB Conference","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: The 21st VLDB Conference, pp. 574\u2013584. Morgan Kaufmann Publishers, San Francisco (1995)"},{"key":"45_CR6","first-page":"57","volume-title":"Proc. 2nd International Workshop on Similarity Search and Applications (SISAP)","author":"R. Uribe","year":"2009","unstructured":"Uribe, R., Navarro, G.: Egnat: A fully dynamic metric access method for secondary memory. In: Proc. 2nd International Workshop on Similarity Search and Applications (SISAP), pp. 57\u201364. IEEE CS Press, Los Alamitos (2009)"},{"issue":"1","key":"45_CR7","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":"45_CR8","series-title":"Scientific and Engineering computation Series","volume-title":"Using MPI:Portable Parallel Programming with the Message Passing Interface","author":"W. Gropp","year":"1994","unstructured":"Gropp, W., Lusk, E., Skelljum, A.: Using MPI:Portable Parallel Programming with the Message Passing Interface. Scientific and Engineering computation Series. MIT Press, Cambridge (1994)"},{"key":"45_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine \u2013 A User\u2019s Guide and Tutorial for Network Parallel Computing","author":"A. Geist","year":"1994","unstructured":"Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, B., Sunderam, V.: PVM: Parallel Virtual Machine \u2013 A User\u2019s Guide and Tutorial for Network Parallel Computing. MIT Press, Cambridge (1994)"},{"issue":"1","key":"45_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L. Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: An industry-standard API for shared-memory programming. IEEE Computational Science and Engineering\u00a05(1), 46\u201355 (1998)","journal-title":"IEEE Computational Science and Engineering"},{"key":"45_CR11","first-page":"147","volume-title":"RIDE 1998: Proceedings of the Workshop on Research Issues in Database Engineering","author":"P. Zezula","year":"1998","unstructured":"Zezula, P., Savino, P., Rabitti, F., Amato, G., Ciaccia, P.: Processing m-trees with parallel resources. In: RIDE 1998: Proceedings of the Workshop on Research Issues in Database Engineering, p. 147. IEEE Computer Society, Washington, DC (1998)"},{"key":"45_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-47840-X_16","volume-title":"Advanced Environments, Tools, and Applications for Cluster Computing","author":"A. Alpkocak","year":"2002","unstructured":"Alpkocak, A., Danisman, T., Ulker, T.: A parallel similarity search in high dimensional metric space using M-tree. In: Grigoras, D., Nicolau, A., Toursel, B., Folliot, B. (eds.) IWCC 2001. LNCS, vol.\u00a02326, pp. 166\u2013252. Springer, Heidelberg (2002)"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-72584-8_30","volume-title":"Computational Science \u2013 ICCS 2007","author":"M. Marin","year":"2007","unstructured":"Marin, M., Uribe, R., Barrientos, R.J.: Searching and updating metric space databases using the parallel EGNAT. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol.\u00a04487, pp. 229\u2013236. Springer, Heidelberg (2007)"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2008.09.010","volume":"7","author":"V. Gil-Costa","year":"2009","unstructured":"Gil-Costa, V., Marin, M., Reyes, N.: Parallel query processing on distributed clustering indexes. Journal of Discrete Algorithms\u00a07(1), 3\u201317 (2009)","journal-title":"Journal of Discrete Algorithms"},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Gil-Costa, V., Barrientos, R., Marin, M., Bonacic, C.: Scheduling metric-space queries processing on multi-core processors. In: Euromicro Conference on Parallel, Distributed, and Network-Based Processing, pp. 187\u2013194 (2010)","DOI":"10.1109\/PDP.2010.94"},{"key":"45_CR16","first-page":"38","volume-title":"6th International Symposium on String Processing and Information Retrieval (SPIRE 1999)","author":"E. Ch\u00e1vez","year":"1999","unstructured":"Ch\u00e1vez, E., Marroqu\u00edn, J., Baeza-Yates, R.: Spaghettis: An array based algorithm for similarity queries in metric spaces. In: 6th International Symposium on String Processing and Information Retrieval (SPIRE 1999), pp. 38\u201346. IEEE CS Press, Los Alamitos (1999)"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.parco.2007.10.001","volume":"33","author":"Wu-Feng","year":"2007","unstructured":"Wu-Feng, Manocha, D.: High-performance computing using accelerators. Parallel Computing\u00a033, 645\u2013647 (2007)","journal-title":"Parallel Computing"},{"key":"45_CR18","unstructured":"GPGPU, general-purpose computation using graphics hardware, \n \n http:\/\/www.gpgpu.org"},{"key":"45_CR19","unstructured":"NVIDIA CUDA Compute Unified Device Architecture-Programming Guide, Version 2.3. NVIDIA (2009), \n \n http:\/\/developer.nvidia.com\/object\/gpucomputing.html"},{"key":"45_CR20","unstructured":"Kuang, Q., Zhao, L.: A practical GPU based kNN algorithm. In: International Symposium on Computer Science and Computational Technology (ISCSCT), pp. 151\u2013155 (2009)"},{"key":"45_CR21","doi-asserted-by":"crossref","unstructured":"Garcia, V., Debreuve, E., Barlaud, M.: Fast k nearest neighbor search using GPU. In: Computer Vision and Pattern Recognition Workshop, pp. 1\u20136 (2008)","DOI":"10.1109\/CVPRW.2008.4563100"},{"key":"45_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11758549_30","volume-title":"Computational Science \u2013 ICCS 2006","author":"B. Bustos","year":"2006","unstructured":"Bustos, B., Deussen, O., Hiller, S., Keim, D.A.: A graphics hardware accelerated algorithm for nearest neighbor search. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol.\u00a03994, pp. 196\u2013199. Springer, Heidelberg (2006)"},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Satish, N., Harris, M., Garland, M.: Designing efficient sorting algorithms for manycore GPUs. In: Parallel and Distributed Processing Symposium, International, pp. 1\u201310 (2009)","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"45_CR24","unstructured":"Barrientos, R.J., G\u00f3mez, J.I., Tenllado, C., Prieto, M.: Heap based k-nearest neighbor search on GPUs. In: Congreso Espa\u00f1ol de Inform\u00e1tica (CEDI), Valencia, Septiembre (2010)"},{"key":"45_CR25","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21928-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T23:40:34Z","timestamp":1553816434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21928-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219276","9783642219283"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21928-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}