Parallel collection-equi join algorithms for object-oriented databases

D. Taniar, J. W. Rahayu

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

    4 Citations (Scopus)

    Abstract

    One of the differences between relational and object-oriented databases (OODB) is that attributes in OODB can be of a collection type (e.g. sets, lists, arrays, bags) as well as a simple type (e.g., integer, string). Consequently, explicit join queries in OODB may be based on collection attributes. One form of collection join queries in OODB is "collection-equi join queries", where the joins are based on collection attributes and the queries check for an equality of both collection operands. Our previous work (1997) describes "Parallel Double Sort-Merge" algorithm for collection-equi join queries, Since the publication, we realize that we have overlooked the complexity of collection merging in the algorithm. In this paper, we not only present alternative solutions relating to the collection merging problem, but also introduce a new algorithm called "Parallel Sort-Hash" algorithm. The two algorithms play an important role in parallel object-oriented query processing, due to their superiority over the conventional join methods through relational division and intersection operators.

    Original languageEnglish
    Title of host publicationProceedings - IDEAS 1998
    Subtitle of host publicationInternational Database Engineering and Applications Symposium
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    Pages159-168
    Number of pages10
    ISBN (Print)0818683074, 9780818683077
    DOIs
    Publication statusPublished - 1998
    Event1998 International Database Engineering and Applications Symposium, IDEAS 1998 - Cardiff, Wales, United Kingdom
    Duration: 8 Jul 199810 Jul 1998

    Conference

    Conference1998 International Database Engineering and Applications Symposium, IDEAS 1998
    CountryUnited Kingdom
    CityCardiff, Wales
    Period8/07/9810/07/98

    Cite this