2514 search results - page 69 / 503 » On the Computation of Approximations of Database Queries |
235
click to vote
ICDE
2011
IEEE
14 years 9 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
185
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
175
click to vote
CINQ
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
195
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce the problem of Constrained Subspace Skyline Queries. This class of queries can be thought of as a generalization of subspace skyline queries using range...
165
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
Semistructured data, in particular XML, has emerged as one of the primary means for information exchange and content management. The power of XML allows authors to structure a doc...