Optimizing multi-join queries in parallel relational databases

Jaideep Srivastava, Gary Elsesser

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

14 Citations (Scopus)

Abstract

Query optimization for parallel machines needs to consider machine architecture, processor and memory resources available, and different types of parallelism, making the search space much larger than the sequential case. In this paper our aim is to determine a plan that makes the execution of an individual query very fast, making minimizing parallel execution time the right objective. This creates the following circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and this is needed for the cost-based search for a good plan tree. In this paper we propose a new search heuristic that breaks the cycle by constructing the plan tree layer by layer in a bottom-up manner. To select nodes at the next level, the lower and upper bounds on the execution time for plans consistent with the decisions made so far are estimated and are used to guide the search. A query plan representation for intra- and inter-operator parallelism, pipelining, and processor and memory assignment is proposed. Also proposed is a new approach to estimating the parallel execution time of a plan that considers sum and mat of operators working sequentially and in parallel, respectively. The results obtained from a prototype optimizer are presented.

Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages84-92
Number of pages9
ISBN (Electronic)0818633301, 9780818633300
DOIs
Publication statusPublished - 1 Jan 1993
Externally publishedYes
Event2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993 - San Diego, United States
Duration: 20 Jan 199322 Jan 1993

Publication series

NameProceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993

Conference

Conference2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993
CountryUnited States
CitySan Diego
Period20/1/9322/1/93

Fingerprint

Parallel Databases
Relational Database
Join
Query
Data storage equipment
Execution Time
Parallelism
Assignment
Operator
Costs
Query Optimization
Pipelining
Resources
Heuristic Search
Parallel Machines
Bottom-up
Relational database
Search Space
Upper and Lower Bounds
Prototype

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Information Systems and Management
  • Control and Optimization

Cite this

Srivastava, J., & Elsesser, G. (1993). Optimizing multi-join queries in parallel relational databases. In Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993 (pp. 84-92). [253067] (Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/PDIS.1993.253068

Optimizing multi-join queries in parallel relational databases. / Srivastava, Jaideep; Elsesser, Gary.

Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993. Institute of Electrical and Electronics Engineers Inc., 1993. p. 84-92 253067 (Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993).

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

Srivastava, J & Elsesser, G 1993, Optimizing multi-join queries in parallel relational databases. in Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993., 253067, Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993, Institute of Electrical and Electronics Engineers Inc., pp. 84-92, 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993, San Diego, United States, 20/1/93. https://doi.org/10.1109/PDIS.1993.253068
Srivastava J, Elsesser G. Optimizing multi-join queries in parallel relational databases. In Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993. Institute of Electrical and Electronics Engineers Inc. 1993. p. 84-92. 253067. (Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993). https://doi.org/10.1109/PDIS.1993.253068
Srivastava, Jaideep ; Elsesser, Gary. / Optimizing multi-join queries in parallel relational databases. Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993. Institute of Electrical and Electronics Engineers Inc., 1993. pp. 84-92 (Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993).
@inproceedings{3f72ea677a4b45f6aa5629b1567f5e7b,
title = "Optimizing multi-join queries in parallel relational databases",
abstract = "Query optimization for parallel machines needs to consider machine architecture, processor and memory resources available, and different types of parallelism, making the search space much larger than the sequential case. In this paper our aim is to determine a plan that makes the execution of an individual query very fast, making minimizing parallel execution time the right objective. This creates the following circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and this is needed for the cost-based search for a good plan tree. In this paper we propose a new search heuristic that breaks the cycle by constructing the plan tree layer by layer in a bottom-up manner. To select nodes at the next level, the lower and upper bounds on the execution time for plans consistent with the decisions made so far are estimated and are used to guide the search. A query plan representation for intra- and inter-operator parallelism, pipelining, and processor and memory assignment is proposed. Also proposed is a new approach to estimating the parallel execution time of a plan that considers sum and mat of operators working sequentially and in parallel, respectively. The results obtained from a prototype optimizer are presented.",
author = "Jaideep Srivastava and Gary Elsesser",
year = "1993",
month = "1",
day = "1",
doi = "10.1109/PDIS.1993.253068",
language = "English",
series = "Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "84--92",
booktitle = "Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993",

}

TY - GEN

T1 - Optimizing multi-join queries in parallel relational databases

AU - Srivastava, Jaideep

AU - Elsesser, Gary

PY - 1993/1/1

Y1 - 1993/1/1

N2 - Query optimization for parallel machines needs to consider machine architecture, processor and memory resources available, and different types of parallelism, making the search space much larger than the sequential case. In this paper our aim is to determine a plan that makes the execution of an individual query very fast, making minimizing parallel execution time the right objective. This creates the following circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and this is needed for the cost-based search for a good plan tree. In this paper we propose a new search heuristic that breaks the cycle by constructing the plan tree layer by layer in a bottom-up manner. To select nodes at the next level, the lower and upper bounds on the execution time for plans consistent with the decisions made so far are estimated and are used to guide the search. A query plan representation for intra- and inter-operator parallelism, pipelining, and processor and memory assignment is proposed. Also proposed is a new approach to estimating the parallel execution time of a plan that considers sum and mat of operators working sequentially and in parallel, respectively. The results obtained from a prototype optimizer are presented.

AB - Query optimization for parallel machines needs to consider machine architecture, processor and memory resources available, and different types of parallelism, making the search space much larger than the sequential case. In this paper our aim is to determine a plan that makes the execution of an individual query very fast, making minimizing parallel execution time the right objective. This creates the following circular dependence: a plan tree is needed for effective resource assignment, which is needed to estimate the parallel execution time, and this is needed for the cost-based search for a good plan tree. In this paper we propose a new search heuristic that breaks the cycle by constructing the plan tree layer by layer in a bottom-up manner. To select nodes at the next level, the lower and upper bounds on the execution time for plans consistent with the decisions made so far are estimated and are used to guide the search. A query plan representation for intra- and inter-operator parallelism, pipelining, and processor and memory assignment is proposed. Also proposed is a new approach to estimating the parallel execution time of a plan that considers sum and mat of operators working sequentially and in parallel, respectively. The results obtained from a prototype optimizer are presented.

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

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

U2 - 10.1109/PDIS.1993.253068

DO - 10.1109/PDIS.1993.253068

M3 - Conference contribution

AN - SCOPUS:84994073615

T3 - Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993

SP - 84

EP - 92

BT - Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems, PDIS 1993

PB - Institute of Electrical and Electronics Engineers Inc.

ER -