Sciweavers

467 search results - page 15 / 94
» Processing top k queries from samples
Sort
View
WWW
2007
ACM
14 years 10 months ago
Answering relationship queries on the web
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
Gang Luo, Chunqiang Tang, Ying-li Tian
EDBT
2009
ACM
160views Database» more  EDBT 2009»
14 years 1 months ago
Estimating aggregates in time-constrained approximate queries in Oracle
The concept of time-constrained SQL queries was introduced to address the problem of long-running SQL queries. A key approach adopted for supporting time-constrained SQL queries i...
Ying Hu, Seema Sundara, Jagannathan Srinivasan
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 9 months ago
Fast k Nearest Neighbor Search using GPU
Statistical measures coming from information theory represent interesting bases for image and video processing tasks such as image retrieval and video object tracking. For example...
Vincent Garcia, Eric Debreuve, Michel Barlaud
VLDB
2009
ACM
143views Database» more  VLDB 2009»
14 years 9 months ago
Sampling-based estimators for subset-based queries
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...
Shantanu Joshi, Christopher M. Jermaine
ICDE
2006
IEEE
191views Database» more  ICDE 2006»
14 years 10 months ago
Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-based Image Retrieval
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Kien A. Hua, Ning Yu, Danzhou Liu