Parallel database systems: the future of high performance database systems
Communications of the ACM
Parallel sets: an object-oriented methodology for massively parallel programming
Parallel sets: an object-oriented methodology for massively parallel programming
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A status report on the OO7 OODBMS benchmarking effort
OOPSLA '94 Proceedings of the ninth annual conference on Object-oriented programming systems, language, and applications
Shoring up persistent applications
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Object Database Standard: ODMG-93
Object Database Standard: ODMG-93
FAD, a Powerful and Simple Database Language
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Speeding Up Navigational Requests in a Parallel Object Database System
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
The Design, Implementation and Evaluation of an ODMG Compliant, Parallel Object Database Server
Distributed and Parallel Databases
The case for object databases in cloud data management
ICOODB'10 Proceedings of the Third international conference on Objects and databases
Hi-index | 0.00 |
In this paper we describe the design and implementation of ParSets, a means of exploiting parallelism in the SHORE OODBMS. We used ParSets to parallelize the graph traversal portion of the OO7 OODBMS benchmark, and present speedup and scaleup results from parallel SHORE running these traversals on a cluster of commodity workstations connected by a standard ethernet. For some OO7 traversals, SHORE achieved excellent speedup and scaleup; for other OO7 traversals, only marginal speedup and scaleup occurred. The characteristics of these traversals shed light on when the ParSet approach to parallelism can and cannot be applied to speed up an application.