Sciweavers

17 search results - page 3 / 4
» PREFER: A System for the Efficient Execution of Multi-parame...
Sort
View
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 5 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
WWW
2009
ACM
14 years 6 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
EDBT
2010
ACM
132views Database» more  EDBT 2010»
13 years 8 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 5 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 5 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis