Abstract Information retrieval from large databases is becoming crucial for many applications
in different fields such as content searching in multimedia objects, text retrieval or …

A parallel query processing method is proposed for the design and construction of web
search engines to efficiently deal with dynamic variations in query traffic. The method allows …

Large-scale computer platforms that process users' online requests must be capable of
handling unexpected spikes in arrival rates. These platforms, which are composed of …

This paper proposes a strategy to organize metric-space query processing in multi-core
search nodes as understood in the context of search engines running on clusters of …

Similarity search in a large collection of stored objects in a metric database has become a
most interesting problem. The Spaghettis is an efficient metric data structure to index metric …

Similarity search has been widely studied in the last years, as it can be applied to several
fields such as searching by content in multimedia objects, text retrieval or computational …

A critical issue in large scale search engines is to efficiently handle sudden peaks of
incoming query traffic. Research in metric spaces has addressed this problem from the point …

Similarity search in a large collection of stored objects in a metric database has become a
most interesting problem. The Spaghettis is an efficient metric data structure to index metric …

Metric-space similarity search has been proven suitable for searching large collections of
complex objects such as images. A number of distributed index data structures and …

This paper studies the problem of distributing a metric-space search index based on
compact clustering onto a set of distributed memory processors. The aim is enabling efficient …