{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:00Z","timestamp":1759683480838,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T00:00:00Z","timestamp":1467849600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["P103-14-14292P"],"award-info":[{"award-number":["P103-14-14292P"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss National Foundation (SNF)","award":["144238"],"award-info":[{"award-number":["144238"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11042-016-3677-7","type":"journal-article","created":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T08:33:45Z","timestamp":1467880425000},"page":"11859-11887","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Employing GPU architectures for permutation-based indexing"],"prefix":"10.1007","volume":"76","author":[{"given":"Martin","family":"Kruli\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hasmik","family":"Osipyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Marchand-Maillet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,7]]},"reference":[{"key":"3677_CR1","unstructured":"NVIDIA Maxwell GPU Architecture"},{"key":"3677_CR2","first-page":"4","volume":"17","author":"T Alabi","year":"2012","unstructured":"Alabi T, Blanchard JD, Gordon B, Steinbach R (2012) Fast k-selection algorithms for graphics processing units. Journal of Experimental Algorithmics (JEA) 17:4\u20132","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"3677_CR3","doi-asserted-by":"crossref","unstructured":"Amato G, Gennaro C, Savino P (2012) Mi-file: using inverted files for scalable approximate similarity search Multimedia Tools and Applications","DOI":"10.1007\/s11042-012-1271-1"},{"key":"3677_CR4","unstructured":"Amato G, Savino P (2008) Approximate similarity search in metric spaces using inverted files Proceedings of the 3rd international conference on scalable information systems. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), p 28"},{"key":"3677_CR5","doi-asserted-by":"publisher","unstructured":"Batcher KE (1968) Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference, AFIPS \u201968 (Spring). ACM, New York, pp 307\u2013 314","DOI":"10.1145\/1468075.1468121"},{"key":"3677_CR6","unstructured":"Batcher KE (1968) Sorting networks and their applications Proceedings of the april 30\u2013may 2, 1968, spring joint computer conference. ACM, pp 307\u2013314"},{"key":"3677_CR7","unstructured":"Chang D, Jones N, Li M, Ouyang D, Ragade R (2008) Compute pairwise euclidean distances of data points with gpus. In: Proceedings of the IASTED International Symposium on Computational Biology and Bioinformatics (CBB), pp 278\u2013283"},{"issue":"9","key":"3677_CR8","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2008","unstructured":"Ch\u00e1vez E, Figueroa K, Navarro G. (2008) Effective proximity retrieval by ordering permutations. IEEE Trans Pattern Anal Mach Intell 30(9):1647\u20131658","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"3677_CR9","doi-asserted-by":"publisher","unstructured":"Ciaccia P, Patella M (2000) Pac nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces. In: Proceedings of the 16th International Conference on Data Engineering (ICDE 2000). IEEE Computer Society, San Diego, pp 244\u2013255","DOI":"10.1109\/ICDE.2000.839417"},{"issue":"1","key":"3677_CR10","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum L, Enon R (1998) Openmp: an industry standard api for shared-memory programming. Computational Science & Engineering, IEEE 5(1):46\u201355","journal-title":"Computational Science & Engineering, IEEE"},{"key":"3677_CR11","doi-asserted-by":"publisher","unstructured":"Esuli A (2009) Mipai: Using the pp-index to build an efficient and scalable similarity search system. In: Proceedings of the 2009 2nd International Workshop on Similarity Search and Applications. IEEE Computer Society, Washington, pp 146\u2013148","DOI":"10.1109\/SISAP.2009.14"},{"key":"3677_CR12","unstructured":"Esuli A (2009) PP-Index: Using permutation prefixes for efficient and scalable approximate similarity search. In: Proceedings of LSDS-IR, 2009"},{"key":"3677_CR13","doi-asserted-by":"publisher","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC \u201998. ACM, New York, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"3677_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/212433.212444","volume-title":"Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems","author":"HV Jagadish","year":"1995","unstructured":"Jagadish HV, Mendelzon AO, Milo T (1995) Similarity-based queries Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, pp 36\u201345"},{"key":"3677_CR15","doi-asserted-by":"crossref","unstructured":"Jan B, Montrucchio B, Ragusa C, Khan F, Khan O (2012) Fast parallel sorting algorithms on gpus 3","DOI":"10.5121\/ijdps.2012.3609"},{"key":"3677_CR16","unstructured":"Knuth DE (2003) Sorting and searching. Addison-Wesley"},{"key":"3677_CR17","unstructured":"Kruli\u0161 M, Falt Z, Bedn\u00e1rek D, Yaghob J (2012) Task scheduling in hybrid CPU-GPU systems. Informacn\u00e9 Technol\u00f3gie-Aplik\u00e1cie a Te\u00f3ria:17"},{"key":"3677_CR18","volume-title":"4Th ADBIS workshop on GPUs in databases, GID 2015, poitiers, France, September 08, 2015, pages 305\u2013317","author":"M Krulis","year":"2015","unstructured":"Krulis M, Osipyan H, Marchand-Maillet S (2015) Optimizing Sorting and Top-k Selection Steps in Permutation Based Indexing on GPUs 4Th ADBIS workshop on GPUs in databases, GID 2015, poitiers, France, September 08, 2015, pages 305\u2013317"},{"key":"3677_CR19","volume-title":"13Th international workshop on content-based multimedia indexing, CBMI 2015, prague, Czech Republic, June 10\u201312, 2015, pages 1\u20136","author":"M Krulis","year":"2015","unstructured":"Krulis M, Osipyan H, Marchand-Maillet S (2015) Permutation based indexing for high dimensional data on GPU architectures 13Th international workshop on content-based multimedia indexing, CBMI 2015, prague, Czech Republic, June 10\u201312, 2015, pages 1\u20136"},{"key":"3677_CR20","doi-asserted-by":"publisher","unstructured":"Kushilevitz E, Ostrovsky R, Rabani Y (1998) Efficient search for approximate nearest neighbor in high dimensional spaces. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC \u201998. ACM, New York, pp 614\u2013623","DOI":"10.1145\/276698.276877"},{"key":"3677_CR21","doi-asserted-by":"publisher","unstructured":"Li Q, Kecman V, Salman R (2010) A chunking method for euclidean distance matrix calculation on large dataset using multi-gpu. In: Draghici S, Khoshgoftaar TM, Palade V, Pedrycz W, Wani MA, Zhu X (eds) ICMLA. IEEE Computer Society, pp 208\u2013213","DOI":"10.1109\/ICMLA.2010.38"},{"key":"3677_CR22","unstructured":"Lopresti M, Miranda N, Piccoli F, Reyes N (2013) Solving multiple queries through a permutation index in gpu. In: Journal Computacion y Sistemas, San Luis, pp 341\u2013356"},{"key":"3677_CR23","unstructured":"Mohamed H, Marchand-Maillet S (2012) Parallel approaches to permutation-based indexing using inverted files. In: SISAP\u201912, pp 148\u2013161"},{"key":"3677_CR24","first-page":"103","volume-title":"Similarity Search and Applications, volume 8199 of Lecture Notes in Computer Science","author":"H Mohamed","year":"2013","unstructured":"Mohamed H, Marchand-Maillet S (2013) Quantized ranking for permutation-based indexing. In: Brisaboa N, Pedreira O, Zezula P (eds) Similarity Search and Applications, volume 8199 of Lecture Notes in Computer Science. Springer, Berlin, pp 103\u2013114"},{"key":"3677_CR25","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-319-11988-5_26","volume-title":"7Th international conference on similarity search and applications","author":"H Mohammed","year":"2014","unstructured":"Mohammed H, Osipyan H, Stephane M-M (2014) Multi-core (cpu and gpu) for permutation-based indexing 7Th international conference on similarity search and applications. Los Cabos, Mexico, pp 277\u2013288"},{"key":"3677_CR26","doi-asserted-by":"publisher","unstructured":"Monroe L, Wendelberger J, Michalak S (2011) Randomized selection on the gpu. In: Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics, HPG \u201911. ACM, New York, pp 89\u201398","DOI":"10.1145\/2018323.2018338"},{"key":"3677_CR27","doi-asserted-by":"publisher","unstructured":"Novak D, Kyselak M, Zezula P (2010) On locality-sensitive indexing in generic metric spaces. In: Proceedings of the 3rd International Conference on Similarity Search and Applications, SISAP \u201910. ACM, New York, pp 59\u201366","DOI":"10.1145\/1862344.1862354"},{"key":"3677_CR28","unstructured":"NVIDIA Kepler GPU Architecture"},{"issue":"1","key":"3677_CR29","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2008.09.014","volume":"7","author":"M Patella","year":"2009","unstructured":"Patella M, Ciaccia P (2009) Approximate similarity search: A multi-faceted problem. J Discrete Algorithms 7(1):36\u201348","journal-title":"J Discrete Algorithms"},{"key":"3677_CR30","doi-asserted-by":"publisher","unstructured":"Peters H, Schulz-Hildebrandt O, Luttenberger N (2010) Fast in-place sorting with cuda based on bitonic sort. In: Parallel Processing and Applied Mathematics. Springer, pp 403\u2013410","DOI":"10.1007\/978-3-642-14390-8_42"},{"key":"3677_CR31","unstructured":"Pheatt C (2008) Intel\u00ae threading building blocks. Journal of Computing Sciences in Colleges 23(4):298\u2013298"},{"key":"3677_CR32","volume-title":"Foundations of multidimensional and metric data structures (the morgan kaufmann series in computer graphics and geometric modeling)","author":"H Samet","year":"2005","unstructured":"Samet H (2005) Foundations of multidimensional and metric data structures (the morgan kaufmann series in computer graphics and geometric modeling). Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"3677_CR33","unstructured":"Sanders J, Kandrot E (2010) CUDA By Example: An Introduction to General-Purpose GPU Programming, 1st edn. Addison-Wesley Professional"},{"key":"3677_CR34","doi-asserted-by":"publisher","unstructured":"Satish N, Harris M, Garland M (2009) Designing efficient sorting algorithms for manycore gpus. In: Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing, IPDPS \u201909. IEEE Computer Society, Washington, pp 1\u201310","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"3677_CR35","doi-asserted-by":"publisher","unstructured":"Tellez ES, Chvez E, Camarena-Ibarrola A (2009) A brief index for proximity searching. In: Bayro-Corrochano E, Eklundh J-O (eds) CIARP, volume 5856 of Lecture Notes in Computer Science. Springer, pp 529\u2013536","DOI":"10.1007\/978-3-642-10268-4_62"},{"key":"3677_CR36","unstructured":"Ye X, Fan D, Lin W, Yuan N, Ienne P (2010) High performance comparison-based sorting algorithm on many-core gpus. In: IPDPS\u201910, pp 1\u201310"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-016-3677-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-3677-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-3677-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-016-3677-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T15:23:20Z","timestamp":1600874600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-016-3677-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,7]]},"references-count":36,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["3677"],"URL":"https:\/\/doi.org\/10.1007\/s11042-016-3677-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2016,7,7]]}}}