Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cattell, R.G.G. (ed.), The Object Database Standard: ODMG-93, Release 1.1, Morgan Kaufmann, 1994.
Kim, K-C., ”Parallelism in Object-Oriented Query Processing”, Proceedings of the Sixth International Conference on Data Engineering, pp. 209–217, 1990.
Leung, C.H.C. and Ghogomu, H.T., ”A High-Performance Parallel Database Architecture”, Proceedings of the Seventh ACM International Conference on Supercomputing, pp. 377–386, Tokyo, 1993.
Mishra, P. and Eich, M.H., ”Join Processing in Relational Databases”, ACM Computing Surveys, 24(1), pp. 63–113, March 1992.
Taniar, D., and Rahayu, W., ”Parallelization and Object-Orientation: A Database Processing Point of View”, Proceedings of the Twenty-Fourth International Conference on Technology of Object-Oriented Languages and Systems TOOLS ASIA’97, Beijing, China, pp. 301–310, 1997.
Taniar, D. and Rahayu, J.W., ”Parallel Collection-Equi Join Algorithms for Object-Oriented Databases”, Proceedings of International Database Engineering and Applications Symposium IDEAS’98, IEEE Computer Society Press, Cardiff, UK, July 1998.
Taniar, D. and Rahayu, J.W., ”A Taxonomy for Object-Oriented Queries”, a book chapter in Current Trends in Database Technology, Idea Group Publishing, in press 1998.
Taniar, D. and Rahayu, J.W., ”Divide and Partial Broadcast Method for Parallel Collection Join Queries”, High-Performance Computing and Networking, P. Sloot et al (eds.), Springer-Verlag LNCS 1401, pp. 937–939, 1998.
Taniar, D. and Rahayu, J.W., ”Collection-Intersect Join Algorithms for Parallel Object-Oriented Database Systems”, EuroPar’98 Parallel Processing, Springer-Verlag LNCS 1470, D. Pritchard and J. Reeve (eds.), 1998.
Thakore, A.K. and Su, S.Y.W., ”Performance Analysis of Parallel Object-Oriented Query Processing Algorithms”, Distributed and Parallel Databases 2, pp. 59–100, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taniar, D., Wenny Rahayu, J. (1999). Parallel Sub-collection Join Query Algorithms for a High Performance Object-Oriented Database Architecture. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_54
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive