Lookup NU author(s): Dr James Smith,
Professor Paul Watson
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): de F Mendes Sampaio S, Smith J, Paton NW, Watson P
Editor(s): Sakellariou, R., Gurd, J., Freeman, L., Keane, J.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 7th International Euro-Par Conference (Euro-Par)
Year of Conference: 2001
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science