Anytime Database Algorithms
Download:
|
|
by Joshua Grass, Shlomo Zilberstein, Eliot Moss
http://anytime.cs.umass.edu/~jgrass/school/../ps/ada.ps
Add To MetaCart
Abstract:
Optimized queries greatly increases the speed in which queries can be answered by a database. Unfortunately, query optimization is computationally expensive. Can query optimization be combined with anytime algorithm techniques to determine the amount of time to spend optimizing a query and the amount to actually spend executing the query on the database? In this paper I create a database optimizer that searches the entire space of possible logically equivalent queries and accurately estimates the cost of evaluating each query. I evaluate the results of the expected query execution time versus query optimization time and show that the resulting graphs exhibit the qualities we want out of a well-behaved anytime algorithm. 1
Citations
| 213 | Solving time-dependent planning problems – Boddy, Dean - 1989 |
| 152 | The EXODUS Optimizer Generator – Graefe, DeWitt - 1987 |
| 102 | Optimal Composition of Real-Time Systems – Zilberstein, Russell - 1996 |
| 86 | Operational Rationality Through Compilation of Anytime Algorithms – Zilberstein - 1993 |
| 66 | A rule-based view of query optimization – Freytag - 1987 |
| 64 | The Optimization of Queries in Relational Databases – Kooi - 1980 |
| 50 | ªAnytime Sensing, Planning and Action: A Practical Model for Robot Control,º – Zilberstein, Russell - 1993 |
| 23 | Efficient resource-bounded reasoning in AT-RALPH – Zilberstein, Russell - 1992 |
| 7 | Meral Ozsoyoglu. A System for Semantic Query Optimization – Shenoy, Z - 1987 |
| 2 | A fromal model of tradeoff between optimization and execution costs in semantic query optimization – Shekhar, Srivastava, et al. - 1988 |
| 1 | and Shlomo Zilberstein. Programming with anytime algorithms – Grass - 1995 |
