The Community for Technology Leaders
High Performance Computing and Grid in Asia Pacific Region, International Conference on (1997)
Seoul, Korea
Apr. 28, 1997 to May 2, 1997
ISBN: 0-8186-7901-8
pp: 122
David Taniar , Department of Computer and Mathematical Sciences Victoria University of Technology
Wenny Rahayu , La Trobe University Bundoora, Victoria, Australia.
ABSTRACT
In Object-oriented databases (OODB), although path expressions through pointer connections may exist, it is sometimes necessary to perform an explicit join operation between two classes. Since a class may contain collection attributes, as well as simple attributes, join queries in OODB may be based on collections. A need for collection join algorithms arises, since conventional join algorithms, such as hybrid-hash join, GRACE join, were not designed for collection join queries. A new algorithm, so called "Parallel Double Sort-Merge" join algorithm, is proposed. This algorithm plays an important role in parallel object- oriented query processing, due to its superiority over the conventional join methods.
INDEX TERMS
CITATION

D. Taniar and W. Rahayu, "Parallel Double Sort-Merge Algorithm for Object-Oriented Collection Join Queries," High Performance Computing and Grid in Asia Pacific Region, International Conference on(HPCASIA), Seoul, Korea, 1997, pp. 122.
doi:10.1109/HPC.1997.592134
87 ms
(Ver 3.3 (11022016))