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.
Object database management systems (ODBMSs) are now established as the database management technology of choice for a range of challenging data intensive applications. Furthermore, the applications associated with object databases typically have stringent performance requirements, and some are associated with very large data sets. An important feature for the performance of object databases is the speed at which relationships can be explored. In queries, this depends on the effectiveness of different join algorithms into which queries that follow relationships can be compiled. This paper presents a performance evaluation of the Polar parallel object database system, focusing in particular on the performance of parallel join algorithms. Polar is a parallel, shared-nothing implementation of the Object Database Management Group (ODMG) standard for object databases. The paper presents an empirical evaluation of queries expressed in the ODMG Query Language (OQL), as well as a cost model for the parallel algebra that is used to evaluate OQL queries. The cost model is validated against the empirical results for a collection of queries using four different join algorithms, one that is value based and three that are pointer based. Copyright © 2005 John Wiley & Sons, Ltd.
Author(s): de F Mendes Sampaio S, Paton NW, Smith J, Watson P
Publication type: Article
Publication status: Published
Journal: Concurrency Computation Practice and Experience
ISSN (print): 1532-0626
ISSN (electronic): 1532-0634
Publisher: John Wiley & Sons Ltd.
Altmetrics provided by Altmetric