Referenced Items are not available for this document.
Assume that we have an SQL query containing joins and a group-by. The standard way of evaluating this type of query is to first perform all the joins and then the group-by operation. However, it may be possible to perform the group-by early, that is, to push the group-by operation past one or more joins. Early grouping may reduce the query processing cost by reducing the amount of data participating in joins. We formally define the problem, adhering strictly to the semantics of NULL and duplicate elimination in SQL2, and prove necessary and sufficient conditions for deciding when this transformation is valid. In practice, it may be expensive or even impossible to test whether the conditions are satisfied. Therefore, we also present a more practical algorithm that tests a simpler, sufficient condition. This algorithm is fast and detects a large subclass of transformable queries
Published in:
Data Engineering, 1994. Proceedings.10th International Conference
Date of Conference: 14-18 Feb 1994
- Page(s):
- 89 - 100
- Meeting Date :
- 14 Feb 1994-18 Feb 1994
- Print ISBN:
- 0-8186-5402-3
- INSPEC Accession Number:
- 4658178
- Conference Location :
- Houston, TX
- Digital Object Identifier :
- 10.1109/ICDE.1994.283001
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
