W.-Y. Wang∗ and J.C. Sieg∗∗
Scheduling, query, query execution plan, optimizer, buffer, simula- tion
This work describes methods to extend a conventional query opti- mizer to model and yield multiple plans per query, and to schedule the resulting multiple-plan packages. This research focuses on one run-time resource, the buffer pool. A query’s plans for a given query are bundled together into a package. At run-time, a scheduler decides when to admit a package, and then chooses one among the plans in an admitted package. The chosen plan is one that is compatible with available buffers as determined by a variety of scheduling policies. The experimental results verified that a single plan as generated by a query optimizer is not the best one when run-time resources are considered.
Important Links:
Go Back
