New technologies for big multimedia data treatment

With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is bigger. Therefore, it is desirable to have a search system that allows to retrieve information at a reasonable time and in an efficient way. In this paper we show two computing paradigms appropriate to apply in the treatment of large amounts of data consisting of objects such as images, text, sound and video, using hybrid computing over MPI+OpenMP and GPGPU. The proposal is developed through experience gained in the construction of various indexes and the subsequent search, through them, of multimedia objects.

[1]  Lei Zhao,et al.  A Practical GPU Based KNN Algorithm , 2009 .

[2]  Georg Hager,et al.  Communication Characteristics and Hybrid MPI/OpenMP Parallel Pr ogramming on Clusters of Multi-core SMP Nodes , 2009 .

[3]  Kun Zhou,et al.  Real-time KD-tree construction on graphics hardware , 2008, SIGGRAPH 2008.

[4]  Nora Reyes,et al.  (Very) Fast (All) k-Nearest Neighbors in Metric and Non Metric Spaces without Indexing , 2013, SISAP.

[5]  Luisa Micó,et al.  A modification of the LAESA algorithm for approximated k-NN classification , 2003, Pattern Recognit. Lett..

[6]  Alexandros Labrinidis,et al.  Challenges and Opportunities with Big Data , 2012, Proc. VLDB Endow..

[7]  Marco Patella,et al.  Approximate and probabilistic methods , 2010, SIGSPACIAL.

[8]  Mariela Lopresti,et al.  Permutation Index and GPU to Solve efficiently Many Queries , 2013 .

[9]  George K. Thiruvathukal.  Books [reviews of "Networks, Crowds, and Markets: Reasoning about a Highly-Connected World; Easley, D. and Kleinberg, J.; 2010 and "Introduction to High Performance Computing for Scientists and Engineers"; Hager, G. and Wellein, G.; 2011) [Book review] , 2011, Computing in Science & Engineering.

[10]  Gonzalo Navarro,et al.  Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order , 2005, MICAI.

[11]  Liheng Jian,et al.  Design and evaluation of a parallel k-nearest neighbor algorithm on CUDA-enabled GPU , 2010, 2010 IEEE 2nd Symposium on Web Society.

[12]  John D. Owens,et al.  GPU Computing , 2008, Proceedings of the IEEE.

[13]  Pavel Zezula,et al.  Similarity Search: The Metric Space Approach (Advances in Database Systems) , 2005 .

[14]  Andreas Nüchter,et al.  GPU-Accelerated Nearest Neighbor Search for 3D Registration , 2009, ICVS.

[15]  Krzysztof Boryczko,et al.  GPU Bucket Sort Algorithm with Applications to Nearest-neighbour Search , 2008, J. WSCG.

[16]  Nora Reyes,et al.  Similarity Search Using Sparse Pivots for Efficient Multimedia Information Retrieval , 2006, Eighth IEEE International Symposium on Multimedia (ISM'06).

[17]  Jie Cheng,et al.  Programming Massively Parallel Processors. A Hands-on Approach , 2010, Scalable Comput. Pract. Exp..

[18]  Mauricio Marín,et al.  Parallel query processing on distributed clustering indexes , 2009, J. Discrete Algorithms.

[19]  C. Tenllado,et al.  Heap Based k-Nearest Neighbor Search on GPUs , 2013 .

[20]  Tikara Hosino,et al.  Solving k-Nearest Neighbor Problem on Multiple Graphics Processors , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[21]  Hanan Samet,et al.  Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling) , 2005 .

[22]  Amit Singh,et al.  High dimensional reverse nearest neighbor queries , 2003, CIKM '03.

[23]  Gerhard Wellein,et al.  Introduction to High Performance Computing for Scientists and Engineers , 2010, Chapman and Hall / CRC computational science series.

[24]  María Fabiana Piccoli,et al.  Efficient similarity search on multimedia databases , 2012 .

[25]  Frank Nielsen,et al.  K-nearest neighbor search: Fast GPU-based implementations and application to high-dimensional feature matching , 2010, 2010 IEEE International Conference on Image Processing.

[26]  Veronica Gil Costa,et al.  Data Partitioning Evaluation for Multimedia Systems in Hybrid Environments , 2012, 2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing.

[27]  Ricardo A. Baeza-Yates,et al.  Searching in metric spaces , 2001, CSUR.

[28]  Michel Barlaud,et al.  Fast k nearest neighbor search using GPU , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[29]  Gonzalo Navarro,et al.  Speeding up spatial approximation search in metric spaces , 2009, JEAL.

[30]  Mauricio Marín,et al.  kNN Query Processing in Metric Spaces Using GPUs , 2011, Euro-Par.

[31]  Marco Patella,et al.  Approximate similarity search: A multi-faceted problem , 2009, J. Discrete Algorithms.

[32]  Pavel Zezula,et al.  Similarity Search - The Metric Space Approach , 2005, Advances in Database Systems.

[33]  Mauricio Marín,et al.  Scheduling Metric-Space Queries Processing on Multi-Core Processors , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.

[34]  Gonzalo Navarro,et al.  Probabilistic proximity searching algorithms based on compact partitions , 2004, J. Discrete Algorithms.