Sciweavers

78 search results - page 1 / 16
» Searching in metric spaces by spatial approximation
Sort
View
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 5 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
TODS
2002
92views more  TODS 2002»
13 years 4 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
JEA
2008
112views more  JEA 2008»
13 years 4 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
13 years 11 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
SOFSEM
2007
Springer
13 years 11 months ago
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...
Oscar Pedreira, Nieves R. Brisaboa