Parallelizing OODBMS traversals: a performance evaluation

  • Authors:
  • David J. De Witt;Jeffrey F. Naughton;John C. Shafer;Shivakumar Venkataraman

  • Affiliations:
  • Computer Sciences Department, University of Wisconsin Madison, 1210 West Dayton St, Madison WI, 53706, USA;Computer Sciences Department, University of Wisconsin Madison, 1210 West Dayton St, Madison WI, 53706, USA;Computer Sciences Department, University of Wisconsin Madison, 1210 West Dayton St, Madison WI, 53706, USA;Computer Sciences Department, University of Wisconsin Madison, 1210 West Dayton St, Madison WI, 53706, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.