Computer Science – Databases
Scientific paper
2000-11-17
Computer Science
Databases
technical report CW 292 of Katholieke Universiteit Leuven (Short version in In Julius Stuller, Jaroslav Pokorn?, Bernhard Thal
Scientific paper
Queries involving aggregation are typical in database applications. One of the main ideas to optimize the execution of an aggregate query is to reuse results of previously answered queries. This leads to the problem of rewriting aggregate queries using views. Due to a lack of theory, algorithms for this problem were rather ad-hoc. They were sound, but were not proven to be complete. Recently we have given syntactic characterizations for the equivalence of aggregate queries and applied them to decide when there exist rewritings. However, these decision procedures do not lend themselves immediately to an implementation. In this paper, we present practical algorithms for rewriting queries with $\COUNT$ and $\SUM$. Our algorithms are sound. They are also complete for important cases. Our techniques can be used to improve well-known procedures for rewriting non-aggregate queries. These procedures can then be adapted to obtain algorithms for rewriting queries with $\MIN$ and $\MAX$. The algorithms presented are a basis for realizing optimizers that rewrite queries using views.
Cohen Sara
Nutt Werner
Serebrenik Alexander
No associations
LandOfFree
Algorithms for Rewriting Aggregate Queries Using Views does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Algorithms for Rewriting Aggregate Queries Using Views, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Rewriting Aggregate Queries Using Views will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-93673