Sciweavers

80 search results - page 2 / 16
» Constrained Aggregate Similarity Queries in Metric Spaces
Sort
View
PVLDB
2010
121views more  PVLDB 2010»
13 years 15 days ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
DBISP2P
2005
Springer
172views Database» more  DBISP2P 2005»
13 years 11 months ago
A Content-Addressable Network for Similarity Search in Metric Spaces
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content– addressable Network (CAN) parad...
Fabrizio Falchi, Claudio Gennaro, Pavel Zezula
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
13 years 11 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
SBBD
2004
106views Database» more  SBBD 2004»
13 years 7 months ago
Twisting the Metric Space to Achieve Better Metric Trees
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
César Feijó Nadvorny, Carlos A. Heus...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 9 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula