5595 search results - page 789 / 1119 » Comparing Subsumption Optimizations |
307
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
300
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...
289
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
222
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
241
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...