Sciweavers

80 search results - page 5 / 16
» Constrained Aggregate Similarity Queries in Metric Spaces
Sort
View
SEBD
1997
158views Database» more  SEBD 1997»
14 years 10 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
ADC
1999
Springer
68views Database» more  ADC 1999»
15 years 1 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
Paolo Ciaccia, A. Nanni, Marco Patella
TKDE
2008
171views more  TKDE 2008»
14 years 9 months ago
Efficient Similarity Search in Nonmetric Spaces with Local Constant Embedding
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...
Lei Chen 0002, Xiang Lian
IPPS
2007
IEEE
15 years 3 months ago
A Landmark-based Index Architecture for General Similarity Search in Peer-to-Peer Networks
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
Xiaoyu Yang, Yiming Hu
EDBT
2011
ACM
225views Database» more  EDBT 2011»
14 years 29 days ago
On (not) indexing quadratic form distance by metric access methods
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...
Tomás Skopal, Tomás Bartos, Jakub Lo...