Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

11-1993

Abstract

In certain database applications such as deductive databases, batch query processing, and recursive query processing etc., a single query can be transformed into a set ofclosely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unijied multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subezpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs forall queries at once. In this paper, anew heuristic function (f=), dynamic query ordering heuristics, and Depth-First Branch-and-Bound (DFBB) are dejined and experimentally evaluated, and compared with existing methods which use A* and static query ordering. Our experiments show that all three of f., DFBB, and dynamic query ordering help to improve the performance of our h4Q0 algorithm.

Discipline

Databases and Information Systems | Numerical Analysis and Scientific Computing

Publication

CIKM '93: Proceedings of the 2nd International Conference on Information and Knowledge Management, November 1-5, 1993, Washington, DC

First Page

433

Last Page

438

ISBN

9780897916264

Identifier

10.1145/170088.170181

Publisher

ACM

City or Country

New York

Additional URL

http://doi.org/10.1145/170088.170181

Download

Share

COinS