by Damianos Chatziantoniou, Kenneth A. Ross
Proceedings of the 1997 VLDB Conference
http://www.cs.stevens-tech.edu/~damianos/vldb97.ps
Add To MetaCart
Abstract:
In this paper, we define and examine a particular class of queries called group queries. Group queries are natural queries in many decisionsupport applications. The main characteristic of a group query is that it can be executed in a groupby-group fashion. In other words, the underlying relation(s) can be partitioned (based on some set of attributes) into disjoint groups, and each group can be processed separately. We give a syntactic criterion to identify these queries and prove its sufficiency. We also prove the strong result that every group query has an equivalent formulation that satisfies our syntactic criterion. We describe a general evaluation technique for group queries, and demonstrate how an optimizer can determine this plan. We then consider more complex queries whose components are group queries with potentially different partitioning attributes. We give two methods to identify group query components within such a query. We also give some performance results for group queries expressed in standard SQL, comparing a commercial database system with our optimized plan on top of the same commercial system. These results indicate that there are significant potential performance improvements.
Citations
|
521
|
Query evaluation techniques for large databases
– Graefe
- 1993
|
|
369
|
Parallel Database Systems: The Future of High Performance Database Systems
– DeWitt, Gray
- 1992
|
|
123
|
Multiple-query optimization
– Sellis
- 1988
|
|
116
|
On Optimizing an SQL-like Nested Query
– Kim
- 1982
|
|
95
|
Including Group-By in Query Optimization
– Chaudhuri, Shim
- 1994
|
|
92
|
Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates and Quantifiers
– Dayal
- 1987
|
|
55
|
Eager aggregation and lazy aggregation
– Yan, Larson
- 1995
|
|
52
|
Performing group-by before join
– Yan, Larson
- 1994
|
|
45
|
A data model for supporting on-line analytical processing
– Li, Wang
- 1996
|
|
42
|
Complex query decorrelation
– Seshadri, Pirahesh, et al.
- 1996
|
|
39
|
Distributed query processing in a relational data base system
– Epstein, Stonebraker, et al.
- 1978
|
|
34
|
Adaptive Parallel Aggregation Algorithms
– Shatdal, Naughton
- 1995
|
|
28
|
Processing Queries Over Generalization Hierarchies in a Multidatabase System
– Dayal
- 1983
|
|
27
|
Querying multiple features of groups in relational databases
– Chatziantoniou, Ross
- 1996
|
|
24
|
Why Decision Support Fails and How to Fix it
– Kimball, Strehlo
- 1995
|
|
22
|
Optimizing queries with aggregate views
– Chaudhuri, Shim
- 1996
|
|
22
|
The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
– Paola
- 1969
|
|
22
|
Providing Better Support for a Class of Decision Support Queries
– Rao, Badia, et al.
- 1996
|
|
21
|
Sunita Sarawagi. Modeling multidimensional databases
– Agrawal, Gupta
- 1996
|
|
18
|
Access path selection in distributed database management systems
– SELINGER, ADIBA
- 1980
|
|
15
|
Venky Harinarayan and Dallan Quass, Aggregatequery processing in data warehousing environments
– Gupta
- 1995
|
|
2
|
Optimization of Complex Aggregate Queries in Relational Databases
– Chatziantoniou
- 1997
|
|
1
|
CR961 Damianos Chatziantoniou and Kenneth Ross. Querying multiple features of groups in relational databases
– Server, manual, et al.
- 1994
|
