Sciweavers

209 search results - page 6 / 42
» t-Spanners for metric space searching
Sort
View
SISAP
2008
IEEE
147views Data Mining» more  SISAP 2008»
15 years 4 months ago
An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space Databases
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
Veronica Gil Costa, Mauricio Marín, Nora Re...
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
15 years 2 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
15 years 4 months ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
Dario Bonino, Fulvio Corno
CIKM
2006
Springer
15 years 1 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
15 years 3 months ago
Peer-to-Peer Similarity Search Based on M-Tree Indexing
Similarity search in metric spaces has several important applications both in centralized and distributed environments. In centralized applications, such as similarity-based image ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...