136 search results - page 3 / 28 » Using the Distance Distribution for Approximate Similarity Q... |
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 ...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
COCOON
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
DSMML
2004
Springer
13 years 10 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...