{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:37Z","timestamp":1742913337478,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031059025"},{"type":"electronic","value":"9783031059032"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05903-2_13","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T10:04:19Z","timestamp":1652954659000},"page":"183-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["GPU Permutation Index: Good Trade-Off Between Efficiency and Results Quality"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4609-0131","authenticated-orcid":false,"given":"Mariela","family":"Lopresti","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3636-7360","authenticated-orcid":false,"given":"Fabiana","family":"Piccoli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7630-3161","authenticated-orcid":false,"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"issue":"3","key":"13_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.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11579427_41","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Proximity searching in high dimensional spaces with a proximity preserving order. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol. 3789, pp. 405\u2013414. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11579427_41"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Ciaccia, P., Patella, M.: Approximate and probabilistic methods. SIGSPATIAL Spec. 2(2), 16\u201319 (2010). https:\/\/doi.org\/10.1145\/1862413.1862418","DOI":"10.1145\/1862413.1862418"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach, ser. Advances in Database Systems, vol. 32. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-29151-2","DOI":"10.1007\/0-387-29151-2"},{"key":"13_CR5","unstructured":"Pacheco, P., Malensek, M.: An Introduction to Parallel Programming, ser. An Introduction to Parallel Programming. Elsevier Science (2021). https:\/\/books.google.com.ar\/books?id=uAfXnQAACAAJ"},{"key":"13_CR6","unstructured":"Robey, R., Zamora, Y.: Parallel and High Performance Computing. Simon and Schuster (2021). https:\/\/books.google.com.ar\/books?id=jNstEAAAQBAJ"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Kirk, D.B., Hwu, W.: Programming Massively Parallel Processors, A Hands on Approach. Elsevier, Morgan Kaufmann (2017). https:\/\/doi.org\/10.1016\/C2015-0-02431-5","DOI":"10.1016\/C2015-0-02431-5"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"4611","DOI":"10.1007\/s11227-017-2110-y","volume":"73","author":"R Barrientos","year":"2017","unstructured":"Barrientos, R., Millaguir, F., S\u00e1nchez, J.L., Arias, E.: GPU-based exhaustive algorithms processing KNN queries. J. Supercomput. 73, 4611\u20134634 (2017)","journal-title":"J. Supercomput."},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Kruli\u0161, M., Osipyan, H., Marchand-Maillet, S.: Employing GPU architectures for permutation-based indexing. Multimedia Tools Appl. 76(05) (2017). https:\/\/doi.org\/10.1007\/s11042-016-3677-7","DOI":"10.1007\/s11042-016-3677-7"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-319-25087-8_25","volume-title":"Similarity Search and Applications","author":"S Li","year":"2015","unstructured":"Li, S., Amenta, N.: Brute-Force k-nearest neighbors search on the GPU. In: Amato, G., Connor, R., Falchi, F., Gennaro, C. (eds.) SISAP 2015. LNCS, vol. 9371, pp. 259\u2013270. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25087-8_25"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Velentzas, P., Vassilakopoulos, M., Corral, A.: In-memory k nearest neighbor GPU-based query processing. In: Proceedings of the 6th International Conference on Geographical Information Systems Theory, Applications and Management - GISTAM, INSTICC, pp. 310\u2013317. SciTePress (2020)","DOI":"10.5220\/0009781903100317"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Barrientos, R.J., G\u00f3mez, J.I., Tenllado, C., Prieto, M., Zezula, P.: Multi-level clustering on metric spaces using a multi-GPU platform. In: Euro-Par (2013)","DOI":"10.1007\/978-3-642-40047-6_24"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Eder dos Santos, R.U.P., Sofia, A.A.O.: Procesamiento de b\u00fasquedas por similitud. tecnolog\u00edas de paralelizaci\u00f3n e indexaci\u00f3n. In: Informe Cient\u00edfico T\u00e9cnico UNPA, vol. 7, no. 2, pp. 111\u2013138 (2015)","DOI":"10.22305\/ict-unpa.v7i2.130"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"06","DOI":"10.1016\/j.jpdc.2019.06.005","volume":"133","author":"M Gowanlock","year":"2019","unstructured":"Gowanlock, M., Karsin, B.: Accelerating the similarity self-join using the GPU. J. Parallel Distrib. Comput. 133, 06 (2019)","journal-title":"J. Parallel Distrib. Comput."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Barrientos, R.J., Riquelme, J.A., Hern\u00e1ndez-Garc\u00eda, R., Navarro, C.A., Soto-Silva, W.: Fast KNN query processing over a multi-node GPU environment. J. Supercomput., 3045\u20133071 (2022)","DOI":"10.1007\/s11227-021-03975-2"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Riquelme, J.A., Barrientos, R.J., Hern\u00e1ndez-Garc\u00eda, R., Navarro, C.A.: An exhaustive algorithm based on GPU to process a KNN query. In: 2020 39th International Conference of the Chilean Computer Science Society (SCCC), pp. 1\u20138 (2020)","DOI":"10.1109\/SCCC51225.2020.9281231"},{"key":"13_CR17","unstructured":"Lopresti, M., Piccoli, F., Reyes, N.: Goodness of the GPU permutation index: performance and quality results. In: XXVII Congreso Argentino de Ciencias de la Computaci\u00f3n, CACIC 2021, pp. 321\u2013332 (2021)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Figueroa, K., Ch\u00e1vez, E., Navarro, G., Paredes, R.: Speeding up spatial approximation search in metric spaces. ACM J. Exp. Algorithmics 14 (2009). Article 3.6","DOI":"10.1145\/1498698.1564506"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Bustos, B., Navarro, G.: Probabilistic proximity searching algorithms based on compact partitions. J. Discrete Algorithms 2(1), 115\u2013134 (2004). The 9th International Symposium on String Processing and Information Retrieval. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570866703000674","DOI":"10.1016\/S1570-8667(03)00067-4"},{"key":"13_CR20","unstructured":"Tokoro, K., Yamaguchi, K., Masuda, S.: Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search. In: Proceedings of the 29th Australasian Computer Science Conference - Volume 48, ser. ACSC 2006, Darlinghurst, Australia, pp. 77\u201383. Australian Computer Society Inc., Australia (2006). http:\/\/dl.acm.org\/citation.cfm?id=1151699.1151709"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Singh, A., Ferhatosmanoglu, H., Tosun, A.: High dimensional reverse nearest neighbor queries. In: The Twelfth International Conference on Information and Knowledge Management, ser. CIKM 2003, pp. 91\u201398. ACM, New York (2003). https:\/\/doi.org\/10.1145\/956863.956882","DOI":"10.1145\/956863.956882"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: A modification of the LAESA algorithm for approximated k-NN classification. Pattern Recogn. Lett. 24(1\u20133), 47\u201353 (2003). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167865502001873","DOI":"10.1016\/S0167-8655(02)00187-3"},{"key":"13_CR23","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA 2003, pp. 28\u201336. Society for Industrial and Applied Mathematics, Philadelphia (2003). http:\/\/dl.acm.org\/citation.cfm?id=644108.644113"},{"key":"13_CR24","volume-title":"Modern Information Retrieval","author":"RA Baeza-Yates","year":"2011","unstructured":"Baeza-Yates, R.A., Ribeiro-Neto, B.A.: Modern Information Retrieval. Pearson Education Ltd., Harlow (2011)"},{"key":"13_CR25","unstructured":"Cheng, J., Grossman, M.: Professional CUDA C Programming. CreateSpace Independent Publishing Platform (2017). https:\/\/books.google.com.ar\/books?id=ApBtswEACAAJ"},{"key":"13_CR26","unstructured":"Han, J., Sharma, B.: Learn CUDA Programming: A Beginner\u2019s Guide to GPU Programming and Parallel Computing with CUDA 10.x and C\/C++. Packt Publishing (2019). https:\/\/books.google.com.ar\/books?id=dhWzDwAAQBAJ"},{"key":"13_CR27","unstructured":"NVIDIA: Nvidia CUDA compute unified device architecture, programming guide, in NVIDIA (2020)"},{"key":"13_CR28","unstructured":"Lopresti, M., Miranda, N., Piccoli, F., Reyes, N.: Permutation index and GPU to solve efficiently many queries. In: VI Latin American Symposium on High Performance Computing, HPCLatAm 2013, pp. 101\u2013112 (2013)"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-32047-8_14","volume-title":"Similarity Search and Applications","author":"K Figueroa","year":"2019","unstructured":"Figueroa, K., Reyes, N.: Permutation\u2019s signatures for proximity searching in metric spaces. In: Amato, G., Gennaro, C., Oria, V., Radovanovi\u0107, M. (eds.) SISAP 2019. LNCS, vol. 11807, pp. 151\u2013159. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32047-8_14"}],"container-title":["Communications in Computer and Information Science","Computer Science \u2013 CACIC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05903-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T10:08:41Z","timestamp":1652954921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05903-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031059025","9783031059032"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05903-2_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CACIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentine Congress of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cacic2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cacic2021.unsa.edu.ar\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"RedUNCI","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"130","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}