Skip to main content
SpringerLink
Log in

An efficiency study of a pivot-based algorithm for similarity search on a heterogeneous platform

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Graphics processing units have definitely consolidated a position of privilege in the acceleration of general purpose applications. Search algorithms in large databases are a clear example of applications that benefit from computing platforms based on these devices. To obtain an efficient implementation of a given code using these platforms, it is very important to take into account their features. However, the characteristics of the application and certain overheads still introduced by these platforms, make it not always advisable to use these devices to obtain significant time reductions. In this paper, we show how different properties of current graphics processing units are exploited for improving a version of the general metric structure similarity search algorithm introduced by the authors, and compare it with a multithreaded version of the same algorithm using conventional processors. The analysis of the results provides us relevant data to determine the most appropriate computing platform.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Micó 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–17

    Article  Google Scholar 

  2. Baeza-Yates R, Cunto W, Manber U, Wu S (1994) Proximity matching using fixed-queries trees. In: 5th Combinatorial Pattern Matching (CPM’94), LNCS, vol 807. Springer, Berlin, pp 198–212

  3. Chávez E, Marroquín 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’99). IEEE CS Press, pp 38–46

  4. Chávez E, Marroquín JL, Navarro G (2001) Fixed queries array: a fast and economical data structure for proximity searching. Multimedia Tools Appl 14(2):113–135

    Article  MATH  Google Scholar 

  5. 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–445

  6. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL (2001) Searching in metric spaces. ACM Comput Surveys 33(3):273–321

    Article  Google Scholar 

  7. 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–232

    Chapter  Google Scholar 

  8. Kuang Q, Zhao L (2009) A practical GPU based kNN algorithm. In: International Symposium on Computer Science and Computational Technology (ISCSCT), pp 151–155

  9. Garcia V, Debreuve E, Barlaud M (2008) Fast k nearest neighbor search using GPU. In: Computer Vision and Pattern Recognition Workshop, pp 1–6

  10. Barrientos RJ, Gómez JI, Tenllado C, Matias MP, Marin M (2013) Range query processing on single and multi GPU environments. Comput Electr Eng 39(8):2656–2668

    Article  Google Scholar 

  11. Uribe-Paredes R, Arias E, Sánchez 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–449

  12. 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–663

  13. 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

  14. Kruliš M, Skopal T, Lokoč J, Beecks C (2012) Combining cpu and gpu architectures for fast similarity search. Distrib Parallel Databases 30(3–4):179–207

    Article  Google Scholar 

  15. Uribe-Paredes R, Cazorla D, Arias E, Sánchez JL (2014) Towards an efficient static scheduling scheme for delivering queries to heterogeneous clusters in the similarity search problem. J Supercomput 70(2):527–540

    Article  Google Scholar 

  16. Wattsup.Net. https://www.wattsupmeters.com/secure/products.php?pn=0&wai=0&spec=3. Accessed 5 May 2016

Download references

Acknowledgments

This work has been partially supported by the MINECO under the Project CGL2013-48367-P, and by the JCCM and European Commission (FEDER funds) under the Project PEII-2014-028-P.

Author information

Authors and Affiliations

  1. Computer Engineering Department, University of Magallanes, Ave. Bulnes, 01855, Punta Arenas, Chile

    R. Uribe-Paredes

  2. Computing Systems Department, University of Castilla-La Mancha, Campus Universitario s/n, Albacete, Spain

    E. Arias, D. Cazorla & J. L. Sánchez

Authors
  1. R. Uribe-Paredes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Arias
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Cazorla
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. L. Sánchez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. L. Sánchez.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Uribe-Paredes, R., Arias, E., Cazorla, D. et al. An efficiency study of a pivot-based algorithm for similarity search on a heterogeneous platform. J Supercomput 73, 384–401 (2017). https://doi.org/10.1007/s11227-016-1868-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-016-1868-7

Keywords

Search

Navigation