Join processing in relational databases
ACM Computing Surveys (CSUR)
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
Performance analysis of parallel object-oriented query processing algorithms
Distributed and Parallel Databases - Special issue on distributed/parallel database object 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
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Implementation of Parallel Collection Equi-Join Using MPI
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Merging data records on EREW PRAM
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
| Hi-index | 0.00 |
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.