907 search results - page 12 / 182 » Efficient Optimization of Iterative Queries |
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
Query optimizers use base-table statistics to derive statistics on the sub-plans that are enumerated during optimization. In practice, traditional optimizers rely on a number of s...
ADHOCNOW
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) ...
IDEAS
1999
IEEE
13 years 12 months ago
1999
IEEE
The number of documents published via WWW in form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of documents
ICDE
1995
IEEE
14 years 9 months ago
1995
IEEE
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolv...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...