Sciweavers

Share
DAWAK
2003
Springer

Computing SQL Queries with Boolean Aggregates

11 years 10 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or disjunction of a set of conditions. When combined with grouping, Boolean aggregates allow us to compute all types of non-aggregated subqueries in a uniform manner. The resulting query trees are simple and amenable to further optimization. Our approach can be combined with other optimization techniques and can be implemented with a minimum of changes in any cost-based optimizer.
Antonio Badia
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where DAWAK
Authors Antonio Badia
Comments (0)
books