175 search results - page 10 / 35 » Cost-Aware Processing of Similarity Queries in Structured Ov... |
202
click to vote
PODS
1998
ACM
15 years 10 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 ...
205
click to vote
DEXA
2009
Springer
16 years 18 days ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
187
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
169
click to vote
COOPIS
2004
IEEE
15 years 9 months ago
2004
IEEE
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
138
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...