Sciweavers

167 search results - page 5 / 34
» Nearest Neighbor Queries in Metric Spaces
Sort
View
EDBT
2009
ACM
92views Database» more  EDBT 2009»
13 years 11 months ago
Efficient skyline computation in metric space
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
David Fuhry, Ruoming Jin, Donghui Zhang

Publication
417views
14 years 4 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
ICDE
2001
IEEE
201views Database» more  ICDE 2001»
14 years 8 months ago
Approximate Nearest Neighbor Searching in Multimedia Databases
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
ICDT
2001
ACM
116views Database» more  ICDT 2001»
13 years 12 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...