Abstract
In object-oriented databases (OODB), though path expressions through pointer connections could exist, it is sometimes necessary to perform a precise be part of operation between 2 categories. Since a category could contain collection attributes, furthermore as straightforward attributes, join queries in OODB could also be supported collections. A need for assortment be part of algorithms arises, since typical join algorithms, like hybrid-hash be part of, GRACE join, were not designed for assortment be part of queries. A new algorithm, therefore referred to as 'Parallel Double Sort-Merge" be part of algorithm, is projected. This rule plays associate degree important role in parallel object-oriented question processing, owing to its superiority over the traditional join strategies.