{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:55Z","timestamp":1740123595899,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T00:00:00Z","timestamp":1473724800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11227-016-1868-7","type":"journal-article","created":{"date-parts":[[2016,9,13]],"date-time":"2016-09-13T06:17:55Z","timestamp":1473747475000},"page":"384-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficiency study of a pivot-based algorithm for similarity search on a heterogeneous platform"],"prefix":"10.1007","volume":"73","author":[{"given":"R.","family":"Uribe-Paredes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Arias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Cazorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3498-9174","authenticated-orcid":false,"given":"J. L.","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"issue":"1","key":"1868_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"ML Mic\u00f3","year":"1994","unstructured":"Mic\u00f3 ML, Oncina J, Vidal E (1994) A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recognit Lett 15(1):9\u201317","journal-title":"Pattern Recognit Lett"},{"key":"1868_CR2","doi-asserted-by":"crossref","unstructured":"Baeza-Yates R, Cunto W, Manber U, Wu S (1994) Proximity matching using fixed-queries trees. In: 5th Combinatorial Pattern Matching (CPM\u201994), LNCS, vol 807. Springer, Berlin, pp 198\u2013212","DOI":"10.1007\/3-540-58094-8_18"},{"key":"1868_CR3","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez E, Marroqu\u00edn JL, Baeza-Yates R (1999) Spaghettis: an array based algorithm for similarity queries in metric spaces. In: 6th International Symposium on String Processing and Information Retrieval (SPIRE\u201999). IEEE CS Press, pp 38\u201346","DOI":"10.1109\/SPIRE.1999.796576"},{"issue":"2","key":"1868_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez E, Marroqu\u00edn JL, Navarro G (2001) Fixed queries array: a fast and economical data structure for proximity searching. Multimedia Tools Appl 14(2):113\u2013135","journal-title":"Multimedia Tools Appl"},{"key":"1868_CR5","doi-asserted-by":"crossref","unstructured":"Pedreira O, Brisaboa NR (2007) Spatial selection of sparse pivots for similarity search in metric spaces. In: 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2007), LNCS, vol 4362. Springer, Harrachov, pp 434\u2013445","DOI":"10.1007\/978-3-540-69507-3_37"},{"issue":"3","key":"1868_CR6","doi-asserted-by":"crossref","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 JL (2001) Searching in metric spaces. ACM Comput Surveys 33(3):273\u2013321","journal-title":"ACM Comput Surveys"},{"key":"1868_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-642-03625-5_9","volume-title":"Swarm intelligence for multi-objective problems in data mining","author":"M Hetland","year":"2009","unstructured":"Hetland M (2009) The basic principles of metric indexing. In: Coello C, Dehuri S, Ghosh S (eds) Swarm intelligence for multi-objective problems in data mining, vol 242., Studies in Computational IntelligenceSpringer, Berlin, pp 199\u2013232"},{"key":"1868_CR8","unstructured":"Kuang Q, Zhao L (2009) A practical GPU based kNN algorithm. In: International Symposium on Computer Science and Computational Technology (ISCSCT), pp 151\u2013155"},{"key":"1868_CR9","doi-asserted-by":"crossref","unstructured":"Garcia V, Debreuve E, Barlaud M (2008) Fast k nearest neighbor search using GPU. In: Computer Vision and Pattern Recognition Workshop, pp 1\u20136","DOI":"10.1109\/CVPRW.2008.4563100"},{"issue":"8","key":"1868_CR10","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1016\/j.compeleceng.2013.05.012","volume":"39","author":"RJ Barrientos","year":"2013","unstructured":"Barrientos RJ, G\u00f3mez JI, Tenllado C, Matias MP, Marin M (2013) Range query processing on single and multi GPU environments. Comput Electr Eng 39(8):2656\u20132668","journal-title":"Comput Electr Eng"},{"key":"1868_CR11","doi-asserted-by":"crossref","unstructured":"Uribe-Paredes R, Arias E, S\u00e1nchez JL, Cazorla D, Valero-Lara P (2012) Improving the performance for the range search on metric spaces using a multi-GPU platform. In: Database and expert systems applications (DEXA), Lecture Notes in Computer Science, vol 7447. Springer, Berlin, pp 442\u2013449","DOI":"10.1007\/978-3-642-32597-7_39"},{"key":"1868_CR12","doi-asserted-by":"crossref","unstructured":"Uribe-Paredes R, Valero-Lara P, Arias E, Sanchez JL, Cazorla D (2011) Similarity search implementations for multi-core and many-core processors. In: International Conference on High Performance Computing and Simulation (HPCS), pp 656\u2013663","DOI":"10.1109\/HPCSim.2011.5999889"},{"key":"1868_CR13","unstructured":"Bolettieri P, Esuli A, Falchi F, Lucchese C, Perego R, Piccioli T, Rabitti F (2009) CoPhIR: a test collection for content-based image retrieval. CoRR. arXiv:0905.4627v2"},{"issue":"3\u20134","key":"1868_CR14","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10619-012-7092-4","volume":"30","author":"M Kruli\u0161","year":"2012","unstructured":"Kruli\u0161 M, Skopal T, Loko\u010d J, Beecks C (2012) Combining cpu and gpu architectures for fast similarity search. Distrib Parallel Databases 30(3\u20134):179\u2013207","journal-title":"Distrib Parallel Databases"},{"issue":"2","key":"1868_CR15","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s11227-013-1079-4","volume":"70","author":"R Uribe-Paredes","year":"2014","unstructured":"Uribe-Paredes R, Cazorla D, Arias E, S\u00e1nchez JL (2014) Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem. J Supercomput 70(2):527\u2013540","journal-title":"J Supercomput"},{"key":"1868_CR16","unstructured":"Wattsup.Net. https:\/\/www.wattsupmeters.com\/secure\/products.php?pn=0&wai=0&spec=3 . Accessed 5 May 2016"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1868-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-016-1868-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1868-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:39:21Z","timestamp":1498329561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1868-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,13]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1868"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1868-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2016,9,13]]}}}