One of the differences between relational and object-oriented databases (OODB) is 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 sub- collection join queries, where the joins are based on collection attributes and the queries check for whether one collection is a sub-collection of the other. The sub-collection predicate can be in a form of subset, sublist, proper subset, or proper sublist. We propose two algorithms for parallel processing of sub-collection join queries. The first one is based on sort-merge-nested-loop, whereas the second is based on sort-hash.
CITATION STYLE
Taniar, D., & Rahayu, J. W. (1999). Parallel sub-collection join query algorithms for a high performance object-oriented database architecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 559–569). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_54
Mendeley helps you to discover research relevant for your work.