Join processing in relational databases
ACM Computing Surveys (CSUR)
A high-performance parallel database architecture
ICS '93 Proceedings of the 7th international conference on Supercomputing
Performance analysis of parallel object-oriented query processing algorithms
Distributed and Parallel Databases - Special issue on distributed/parallel database object management
A taxonomy for object-oriented queries
Current trends in data management
Object Database Standard: ODMG-93
Object Database Standard: ODMG-93
Parallelism in Object-Oriented Query Processing
Proceedings of the Sixth International Conference on Data Engineering
Divide and Partial Broadcast Method for Parallel Collection Join Queries
HPCN Europe 1998 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Collection-Intersect Join Algorithms for Parallel Object-Oriented Database Systems
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Parallelization and Object-Orientation: A Database Processing Point of View
TOOLS '97 Proceedings of the Technology of Object-Oriented Languages and Systems-Tools - 24
Parallel Collection-Equi Join Algorithms for Object-Oriented Databases
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
| Hi-index | 0.00 |
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.