Encapsulation of parallelism in the Volcano query processing system
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A performance evaluation of pointer-based joins
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Iterators, schedulers, and distributed-memory parallelism
Software—Practice & Experience
Polar: an architecture for a parallel ODMG compliant object database
Proceedings of the ninth international conference on Information and knowledge management
Optimizing object queries using an effective calculus
ACM Transactions on Database Systems (TODS)
Performance Analysis of Parallel Query Processing Algorithms for Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
Pointer-Based Join Techniques for Object-Oriented Databases
PDIS '93 Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems
The VLDB Journal — The International Journal on Very Large Data Bases
Parallelizing OODBMS traversals: a performance evaluation
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed Query Processing on the Grid
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Speeding Up Navigational Requests in a Parallel Object Database System
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processing techniques in such systems. However, although many applications associated with object databases also have stringent performance requirements, there has been much less work investigating parallel object database systems. An important feature for the performance of object databases is the speed at which relationships can be explored. In queries, this depends upon the effectiveness of different join algorithms into which queries that follow relationships can be compiled. This paper presents the results of empirical evaluations of four parallel join algorithms, two value based and two pointer based. The experiments have been run on Polar, a parallel ODMG object database system.