Query execution scheduling in parallel object-oriented databases

David Taniar, Clement H.C. Leung

Research output: Contribution to journalArticleResearchpeer-review

12 Citations (Scopus)

Abstract

Complex object-oriented queries generally consist of path expressions and explicit join operations. Since explicit join operations have been acknowledged as the most expensive operations, query executions normally start from the path expressions. Each path expression may form a sub-query. There are two existing strategies to sub-queries processing: 'serial' and 'parallel' execution scheduling strategies. Serial sub-queries execution corresponds to an execution of the sub-queries one-by-one, whereas parallel sub-queries execution corresponds to simultaneous execution of the sub-queries. When a sub-query is being processed, parallelization techniques may be applied. In this paper, we focus on the scheduling issues of the sub-queries, rather than the parallelization of the sub-queries themselves. Rules are formulated to guide the parallel query execution process. Our analysis shows that when there is no load skew, the serial scheduling strategy is preferred, otherwise the parallel scheduling strategy should be used.

Original languageEnglish
Pages (from-to)163-178
Number of pages16
JournalInformation and Software Technology
Volume41
Issue number3
DOIs
Publication statusPublished - 1999
Externally publishedYes

Keywords

  • Access plans
  • Parallel object-oriented databases
  • Parallel query execution
  • Scheduling

Cite this