On resource scheduling of multi-join queries in parallel database systems

DOI10.1016/0020-0190(93)90144-XMaRDI QIDQ1313743zbMATH OpenOpenAlexFDO

Authors Kian-Lee Tan, Hongjun Lu

Publication date 28 July 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90144-x

zbMATH Keywords

hash-joinmulti-join queriesparallel database systemspipelined parallelismresource scheduling

Mathematics Subject Classification ID

Database theory (68P15) Distributed algorithms (68W15)

Review text

This paper presents a two-phase approach to optimizing multi-join queries. Phase 1 produces an operator tree that reflects the join ordering and methods for a query without considering runtime resources. Phase 2 comprises two steps: 1) the operator tree is decomposed into a set of tasks, each of which is a set of joins that can be executed in a pipelined fashion, 2) the tasks are scheduled for execution. We study three scheduling algorithms. While algorithm MaxShelf processes the tasks serially, algorithm MinShelf exploits inter-task prallelism totally. However, it is algorithm FlexiShelf, a hybrid of the two extremes, that performs best.

Recommendations

• Optimization of SQL queries for parallel machines
• Publication:4952618
• scientific article; zbMATH DE number 970736
• Pipelining in multi-query optimization.
• Stochastic optimization for join of three relations in distributed databases. II: Generalization and more applications

Cited in

(4)

• Thrifty execution of task pipelines
• CPU and incremental memory allocation in dynamic parallelization of SQL queries
• Optimization of SQL queries for parallel machines
• Optimization of decentralized multi-way join queries over pipelined filtering services

This page was built for publication: On resource scheduling of multi-join queries in parallel database systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313743)