OSAM*.KBMS/P: A Parallel, Active, Object-Oriented Knowledge Base Server
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Parallel Query Processing Algorithms for Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The newly developed object-oriented database management systems provide rich facilities for the modeling and processing of structural as well as behavioral properties of complex application objects. However, due to the generality and high functionality of these systems, efficiency in processing large object-oriented databases is difficult to achieve using conventional computer systems. Efficient parallel algorithms and architectures are needed to solve this efficiency problem. In our previous work, we have shown that processing OODBs can be viewed as the manipulation of patterns of object associations. Parallel, multiple wavegront algorithms based on an identification approach for verifying association patterns have been introduced. In this paper, we present another approach for processing OODBs, i.e., an elimination approach which eliminates objects that do not satisfy an association pattern specification given in a query instead of identifying objects that satisfy the specification. The new approach allows more processors to operate concurrently on a query, thus allowing a higher degree of parallelism in query processing. A formal proof of the correctness of the new approach is given, and a parallel elimination algorithm for processing tree queries is presented in this paper. Some simulation results are also provided to compare the performance of the identification approach with the elimination approach.