406 search results - page 12 / 82 » A Cost Model for Similarity Queries in Metric Spaces |
DKE
2006
13 years 7 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
WDAG
2005
Springer
14 years 29 days ago
2005
Springer
Transactional Memory is a concurrent programming API in which concurrent threads synchronize via transactions (instead of locks). Although this model has mostly been studied in the...
DASFAA
2007
IEEE
14 years 1 months ago
2007
IEEE
Similarity retrieval have been widely used in many practical search applications. A similarity query model can be viewed as a logical combination of a set of similarity predicates....
EDBT
2009
ACM
14 years 3 days 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...
AP2PC
2003
Springer
14 years 22 days ago
2003
Springer
The objective of query optimizers is to select a good execution plan for a given query. In a distributed system, it is crucial for a query optimizer to have effective remote cost e...