Complex Object Joins in a Distributed Database

Abstract

In non-standard database systems performance tends to be critical. To obtain the required response times for processing complex objects, parallelism needs to be exploited and suitable storage structure for complex objects have to be used. In this paper we use an hierarchical complex object model with object references. The join operations for these complex objects, called tuple-objects, are categorized into materialized, functional and value-based joins. The performance of these joins is analytically evaluated, giving insights into which distributed storage structures for tuple-objects are most effective for the different kinds of joins. Keywords: Complex objects, Distributed databases, Join operation, Performance aspects, Storage structures. 1 Introduction Data-intensive database applications such as robotics, cartography and CAD/CAM, the so-called non-standard database applications, require a high performance in retrieving and processing complex objects. A complex object is a lar...