Parallel double sort-merge algorithm for object-oriented collection join queries

David Taniar, Wenny Rahayu

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publication Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages122-127
Number of pages6
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97 - Seoul, South Korea
Duration: 28 Apr 19972 May 1997

Conference

ConferenceProceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97
CitySeoul, South Korea
Period28/04/972/05/97

Cite this