Sciweavers

792 search results - page 4 / 159
» Computing Iceberg Queries Efficiently
Sort
View
MST
2010
117views more  MST 2010»
13 years 2 months ago
The 1-Versus-2 Queries Problem Revisited
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
Rahul Tripathi
PVLDB
2010
121views more  PVLDB 2010»
13 years 2 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
DAWAK
2009
Springer
13 years 11 months ago
Skyline View: Efficient Distributed Subspace Skyline Computation
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome ...
Jinhan Kim, Jongwuk Lee, Seung-won Hwang
PVLDB
2010
225views more  PVLDB 2010»
13 years 2 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
ICDE
2007
IEEE
218views Database» more  ICDE 2007»
14 years 9 months ago
SKYPEER: Efficient Subspace Skyline Computation over Distributed Data
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...