Sciweavers

160 search results - page 1 / 32
» Efficient skyline retrieval with arbitrary similarity measur...
Sort
View
EDBT
2009
ACM
156views Database» more  EDBT 2009»
13 years 8 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 4 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
PVLDB
2010
121views more  PVLDB 2010»
12 years 11 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
EWCBR
2008
Springer
13 years 6 months ago
Supporting Case-Based Retrieval by Similarity Skylines: Basic Concepts and Extensions
Conventional approaches to similarity search and case-based retrieval, such as nearest neighbor search, require the specification of a global similarity measure which is typically ...
Eyke Hüllermeier, Ilya Vladimirskiy, Bel&eacu...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
14 years 6 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei