We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study with a number of data structures used as indexes for metric space databases. Our optimization criteria are based on requirements for high-performance search engines. The main advantages of our proposal are efficient performance with respect to other approaches (sequentially and in parallel), suitable treatment of secondary memory, and support for OpenMP multithreading. We presents experiments for the asynchronous (MPI) and bulk-synchronous (BSP) message passing models of parallel computing showing that in both models our approach outperforms others consistently. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Marin, M., Gil-Costa, V., & Bonacic, C. (2008). A search engine index for multimedia content. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5168 LNCS, pp. 866–875). https://doi.org/10.1007/978-3-540-85451-7_92
Mendeley helps you to discover research relevant for your work.