This chapter describes several methods of similarity search, based on metric indexing, in
terms of their common, underlying principles. Several approaches to creating lower bounds …

We introduce a novel data structure for solving the range query problem in generic metric
spaces. It can be seen as a dynamic version of the List of Clusters data structure of Chávez …

The metric space model allows abstracting many similarity search problems. Similarity
search has multiple applications especially in the multimedia databases area. The idea is to …

We evaluate the performance of range queries in the Recursive List of Clusters (RLC) metric
data structure, when the metric spaces are natural language dictionaries with the …

Metric indexes aim at reducing the amount of distance evaluations carried out when
searching a metric space. Spatial approximation trees (sa-trees for short), in particular, are …

This paper describes the parallelization of the Spatial Approximation Tree. This data
structure has been shown to be an efficient index structure for solving range queries in high …

Metric space searching is an emerging technique to address the problem of e cient similarity
searching in many applications, including multimedia databases and other repositories …

RANGE QUERIES ON DISTRIBUTED SPATIAL APPROXIMATION TREES Mauricio Marin
Computing Department University of Magallanes Punta Arenas, Chile ABSTRACT This paper …

Hybrid dynamic spatial approximation trees are recently proposed data structures for
searching in metric spaces, based on combining the concepts of spatial approximation and …

Pesquisa de imagens de rosto Page 1 Universidade Nova de Lisboa Faculdade de
Ciências e Tecnologia Departamento de Informática Dissertação de Mestrado em …