Abstract
Conventional query optimizers assume that the cost of optimization is negligible. This assumption does not hold for much larger search spaces (of possible execution plans) such as those encountered during semantic query optimization. In particular, the optimization cost can become comparable to the execution cost, and thus a significant fraction of the response time for interactive queries[1]. This paper discusses the tradeoff between the two costs in the context of semantic query optimization, and reports a heuristic search algorithm which minimizes a weighted sum of both the costs. A detailed analysis of an experiment is presented to strengthen the claim. The paper also contributes a practical model of semantic query optimization, and a discussion of its search ordering and termination problems.
| Original language | English (US) |
|---|---|
| Title of host publication | VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases |
| Editors | Francois Bancilhon, David J. DeWitt |
| Publisher | Morgan Kaufmann Publishers, Inc. |
| Pages | 457-467 |
| Number of pages | 11 |
| ISBN (Electronic) | 0934613753, 9780934613750 |
| State | Published - 1988 |
| Externally published | Yes |
| Event | 14th International Conference on Very Large Data Bases, VLDB 1988 - Los Angeles, United States Duration: Aug 29 1988 → Sep 1 1988 |
Publication series
| Name | VLDB 1988 - Proceedings of the 14th International Conference on Very Large Data Bases |
|---|
Conference
| Conference | 14th International Conference on Very Large Data Bases, VLDB 1988 |
|---|---|
| Country/Territory | United States |
| City | Los Angeles |
| Period | 8/29/88 → 9/1/88 |
Bibliographical note
Publisher Copyright:© VLDB 1987.All rights reserved.
Fingerprint
Dive into the research topics of 'A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS