{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T06:31:25Z","timestamp":1648708285246},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,31]],"date-time":"2013-12-31T00:00:00Z","timestamp":1388448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s11227-013-1079-4","type":"journal-article","created":{"date-parts":[[2013,12,30]],"date-time":"2013-12-30T07:22:05Z","timestamp":1388388125000},"page":"527-540","source":"Crossref","is-referenced-by-count":1,"title":["Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem"],"prefix":"10.1007","volume":"70","author":[{"given":"Roberto","family":"Uribe-Paredes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Cazorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Arias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 L.","family":"S\u00e1nchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,31]]},"reference":[{"issue":"3","key":"1079_CR1","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 Surv 33(3):273\u2013321","journal-title":"ACM Comput Surv"},{"issue":"5","key":"1079_CR2","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I Kalantari","year":"1983","unstructured":"Kalantari I, McDonald G (1983) A data structure and an algorithm for the nearest point problem. IEEE Trans Softw Eng 9(5):631\u2013634","journal-title":"IEEE Trans Softw Eng"},{"key":"1079_CR3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40:175\u2013179","journal-title":"Inf Process Lett"},{"key":"1079_CR4","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd international conference on VLDB, pp 426\u2013435"},{"key":"1079_CR5","unstructured":"Brin S (1995) Near neighbor search in large metric spaces. In: Proceedings of the 21st VLDB conference, pp 574\u2013584"},{"issue":"4","key":"1079_CR6","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1016\/j.is.2011.01.002","volume":"36","author":"G Navarro","year":"2011","unstructured":"Navarro G, Uribe-Paredes R (2011) Fully dynamic metric access methods based on hyperplane partitioning. Inf Syst 36(4):734\u2013747","journal-title":"Inf Syst"},{"issue":"1","key":"1079_CR7","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":"1079_CR8","doi-asserted-by":"crossref","unstructured":"Baeza-Yates R, Cunto W, Manber U, Wu S (1994) Proximity matching using fixed-queries trees. In: Proceedings of the 5th combinatorial pattern matching (CPM\u201994), LNCS-807, pp 198\u2013212","DOI":"10.1007\/3-540-58094-8_18"},{"key":"1079_CR9","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: Proceedings of the 6th international symposium on string processing and information retrieval (SPIRE\u201999), pp 38\u201346","DOI":"10.1109\/SPIRE.1999.796576"},{"issue":"2","key":"1079_CR10","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. Multimed Tools Appl 14(2):113\u2013135","journal-title":"Multimed Tools Appl"},{"key":"1079_CR11","doi-asserted-by":"crossref","unstructured":"Pedreira O, Brisaboa NR (2007) Spatial selection of sparse pivots for similarity search in metric spaces. In: Proceedings of the 33rd conference on current trends in theory and practice of computer science, LNCS-4362, pp 434\u2013445","DOI":"10.1007\/978-3-540-69507-3_37"},{"key":"1079_CR12","unstructured":"Top500. http:\/\/top500.org\/ . Accessed 26 Dec 2013"},{"key":"1079_CR13","unstructured":"Green500. http:\/\/green500.org\/ . Accessed 26 Dec 2013"},{"key":"1079_CR14","doi-asserted-by":"crossref","unstructured":"Duato J, Pe\u00f1a AJ, Silla F, Mayo R, Quintana-Ort\u00ed ES (2010) rCUDA: reducing the number of GPU-based accelerators in high performance clusters. In: Proceedings of the 2010 international conference on high performance computing and simulation (HPCS 2010), pp 224\u2013231","DOI":"10.1109\/HPCS.2010.5547126"},{"key":"1079_CR15","doi-asserted-by":"crossref","unstructured":"Zezula P, Savino P, Rabitti F, Amato G, Ciaccia P (1998) Processing m-trees with parallel resources. In: Proceedings of the workshop on research issues in database engineering, RIDE \u201998, p 147","DOI":"10.1109\/RIDE.1998.658289"},{"key":"1079_CR16","doi-asserted-by":"crossref","unstructured":"Alpkocak A, Danisman T, Tuba U (2002) A parallel similarity search in high dimensional metric space using m-tree. In: Proceedings of the advanced environments, tools, and applications for cluster computing LNCS-2326, pp 247\u2013252","DOI":"10.1007\/3-540-47840-X_16"},{"issue":"1","key":"1079_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jda.2008.09.010","volume":"7","author":"V Gil-Costa","year":"2009","unstructured":"Gil-Costa V, Mar\u00edn M, Reyes N (2009) Parallel query processing on distributed clustering indexes. J Discret Algorithms 7(1):3\u201317","journal-title":"J Discret Algorithms"},{"key":"1079_CR18","doi-asserted-by":"crossref","unstructured":"Gil-Costa V, Barrientos R, Mar\u00edn M, Bonacic C (2010) Scheduling metric-space queries processing on multi-core processors. In: Proceedings of the Euromicro conference on parallel, distributed, and network-based processing, pp 187\u2013194","DOI":"10.1109\/PDP.2010.94"},{"key":"1079_CR19","unstructured":"Kuang Q, Zhao L (2009) A practical GPU based kNN algorithm. In: Proceedings of the international symposium on computer science and computational technology (ISCSCT), pp 151\u2013155"},{"key":"1079_CR20","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"},{"key":"1079_CR21","doi-asserted-by":"crossref","unstructured":"Barrientos RJ, G\u00f3mez JI, Tenllado C, Prieto M, Mar\u00edn M (2011) kNN query processing in metric spaces using GPUs. In: Proceedings of the 17th international European conference on parallel and distributed computing (Euro-Par 2011), LNCS-6852, pp 380\u2013392","DOI":"10.1007\/978-3-642-23400-2_35"},{"key":"1079_CR22","doi-asserted-by":"crossref","unstructured":"Barrientos RJ, G\u00f3mez JI, Tenllado C, Prieto M, Mar\u00edn M (2012) Range query processing in a multi-GPU environment. In: Proceedings of the 10th IEEE international symposium on parallel and distributed processing with applications (ISPA 2012), pp 419\u2013426","DOI":"10.1109\/ISPA.2012.61"},{"key":"1079_CR23","doi-asserted-by":"crossref","unstructured":"Uribe-Paredes R, Valero-Lara P, Arias E, S\u00e1nchez JL, Cazorla D (2011) Similarity search implementations for multi-core and many-core processors. In: Proceedings of the international conference on high performance computing and simulation (HPCS), pp 656\u2013663","DOI":"10.1109\/HPCSim.2011.5999889"},{"key":"1079_CR24","unstructured":"Uribe-Paredes R, Cazorla D, S\u00e1nchez JL, Arias E (2012) A comparative study of different metric structures. In: Thinking on GPU implementations. Lecture notes in engineering and computer science, pp 312\u2013317"},{"key":"1079_CR25","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: Proceedings of the database and expert systems applications (DEXA), LNCS-7447, pp 442\u2013449","DOI":"10.1007\/978-3-642-32597-7_39"},{"key":"1079_CR26","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama A, Karypis G, Kumar V, Gupta A (2003) Introduction to parallel computing, 2nd edn. Addison-Wesley, USA","edition":"2"},{"key":"1079_CR27","unstructured":"Uribe-Paredes R, Arias E, S\u00e1nchez JL, Cazorla D (2013) Metric data structures supported by heterogeneous systems, Technical Report DIAB-13-05-2, University of Castilla-La Mancha, Albacete"},{"key":"1079_CR28","unstructured":"YOKOGAMA PZ4000 POWER ANALYZER. http:\/\/tmi.yokogawa.com\/es\/ . Accessed 26 Dec 2013"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1079-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-1079-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1079-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T12:38:36Z","timestamp":1565008716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-1079-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,31]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1079"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-1079-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,31]]}}}