Graph-Based Parallel Query Processing and Optimization Strategies for Object-Oriented Databases

• Published in: Distributed and parallel databases : an international journal Vol. 6; no. 3; pp. 247 - 285
• Main Authors: Su, Stanley Y.W., Huang, Ying, Akaboshi, Naoki
• Format: Journal Article
• Language: English
• Published: 01.07.1998
• ISSN: 0926-8782; 1573-7578
• DOI: 10.1023/A:1008631132311

Much work has been accomplished in the past on the subject of parallel query processing and optimization in parallel relational database systems; however, little work on the same subject has been done in parallel object-oriented database systems. Since the object-oriented view of a database and its processing are quite different from those of a relational system, it can be expected that techniques of parallel query processing and optimization for the latter can be different from the former. In this paper, we present a general framework for parallel object-oriented database systems and several implemented query processing and optimization strategies together with some performance evaluation results. In this work, multiwavefront algorithms are used in query processing to allow a higher degree of parallelism than the traditional tree-based query processing. Four optimization strategies, which are designed specifically for the multiwavefront algorithms and for the optimization of single as well as multiple queries, are introduced. The query processing algorithms and optimization strategies have been implemented on a parallel computer, nCUBE2; and the results of a performance evaluation are presented in this paper. The main emphases and the intended contributions of this paper are (1) data partitioning, query processing and optimization strategies suitable for parallel OODBMSs, (2) the implementation of the multiwavefront algorithms and optimization strategies, and (3) the performance evaluation results.