45 search results - page 1 / 9 » A Query-sensitive Cost Model for Similarity Queries with M-t... |
PVLDB
2008
13 years 5 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...
PODS
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
ADC
1999
Springer
13 years 10 months ago
1999
Springer
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 ...
P2P
2006
IEEE
13 years 11 months ago
2006
IEEE
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...