Parallelism in object-oriented query processing

An investigation of parallel query processing issues in object-oriented databases is conducted. First the query model to be used is introduced. Three areas in which parallelism can be exploited in the query model are identified. The performance of each of the three areas is measured by mapping the query model to a parallel architecture and using analytic comparisons with the case in which query processing is performed on a single processor. The results show that parallel processing of a query is always somewhat faster than single-processor processing