Multiple query optimization with depth-first branch-and-bound and dynamic query ordering

Ahmet Cosar, Ee Peng Lim, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

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 of closely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs for all queries at once. In this paper, a new heuristic function (fc), dynamic query ordering heuristics, and Depth-First Branch-and-Bound (DFBB) are defined and experimentally evaluated, and compared with existing methods which use A* and static query ordering. Our experiments show that all three of fc, DFBB, and dynamic query ordering help to improve the performance of our MQO algorithm.

Original languageEnglish
Title of host publicationProc 2 Int Conf Inf Knowl Manage
EditorsBharat Bhargava, Timothy Finin, Yelena Yesha
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages433-438
Number of pages6
ISBN (Print)0897916263
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 2nd International Conference on Information and Knowledge Management - Washington, DC, USA
Duration: 1 Nov 19935 Nov 1993

Other

OtherProceedings of the 2nd International Conference on Information and Knowledge Management
CityWashington, DC, USA
Period1/11/935/11/93

Fingerprint

Query processing
Experiments
Intelligent databases

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cosar, A., Lim, E. P., & Srivastava, J. (1993). Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. In B. Bhargava, T. Finin, & Y. Yesha (Eds.), Proc 2 Int Conf Inf Knowl Manage (pp. 433-438). New York, NY, United States: Publ by ACM.

Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. / Cosar, Ahmet; Lim, Ee Peng; Srivastava, Jaideep.

Proc 2 Int Conf Inf Knowl Manage. ed. / Bharat Bhargava; Timothy Finin; Yelena Yesha. New York, NY, United States : Publ by ACM, 1993. p. 433-438.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cosar, A, Lim, EP & Srivastava, J 1993, Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. in B Bhargava, T Finin & Y Yesha (eds), Proc 2 Int Conf Inf Knowl Manage. Publ by ACM, New York, NY, United States, pp. 433-438, Proceedings of the 2nd International Conference on Information and Knowledge Management, Washington, DC, USA, 1/11/93.
Cosar A, Lim EP, Srivastava J. Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. In Bhargava B, Finin T, Yesha Y, editors, Proc 2 Int Conf Inf Knowl Manage. New York, NY, United States: Publ by ACM. 1993. p. 433-438
Cosar, Ahmet ; Lim, Ee Peng ; Srivastava, Jaideep. / Multiple query optimization with depth-first branch-and-bound and dynamic query ordering. Proc 2 Int Conf Inf Knowl Manage. editor / Bharat Bhargava ; Timothy Finin ; Yelena Yesha. New York, NY, United States : Publ by ACM, 1993. pp. 433-438
@inproceedings{6fb9b672c43745bb8c8e70049b9ef3c5,
title = "Multiple query optimization with depth-first branch-and-bound and dynamic query ordering",
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 of closely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs for all queries at once. In this paper, a new heuristic function (fc), dynamic query ordering heuristics, and Depth-First Branch-and-Bound (DFBB) are defined and experimentally evaluated, and compared with existing methods which use A* and static query ordering. Our experiments show that all three of fc, DFBB, and dynamic query ordering help to improve the performance of our MQO algorithm.",
author = "Ahmet Cosar and Lim, {Ee Peng} and Jaideep Srivastava",
year = "1993",
language = "English",
isbn = "0897916263",
pages = "433--438",
editor = "Bharat Bhargava and Timothy Finin and Yelena Yesha",
booktitle = "Proc 2 Int Conf Inf Knowl Manage",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Multiple query optimization with depth-first branch-and-bound and dynamic query ordering

AU - Cosar, Ahmet

AU - Lim, Ee Peng

AU - Srivastava, Jaideep

PY - 1993

Y1 - 1993

N2 - 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 of closely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs for all queries at once. In this paper, a new heuristic function (fc), dynamic query ordering heuristics, and Depth-First Branch-and-Bound (DFBB) are defined and experimentally evaluated, and compared with existing methods which use A* and static query ordering. Our experiments show that all three of fc, DFBB, and dynamic query ordering help to improve the performance of our MQO algorithm.

AB - 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 of closely related database queries. Great benefits can be obtained by executing a group of related queries all together in a single unified multi-plan instead of executing each query separately. In order to achieve this, Multiple Query Optimization (MQO) identifies common task(s) (e.g. common subexpressions, joins, etc.) among a set of query plans and creates a single unified plan (multiplan) which can be executed to obtain the required outputs for all queries at once. In this paper, a new heuristic function (fc), dynamic query ordering heuristics, and Depth-First Branch-and-Bound (DFBB) are defined and experimentally evaluated, and compared with existing methods which use A* and static query ordering. Our experiments show that all three of fc, DFBB, and dynamic query ordering help to improve the performance of our MQO algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0027866029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027866029&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897916263

SP - 433

EP - 438

BT - Proc 2 Int Conf Inf Knowl Manage

A2 - Bhargava, Bharat

A2 - Finin, Timothy

A2 - Yesha, Yelena

PB - Publ by ACM

CY - New York, NY, United States

ER -