Abstract

. Horizontal partitioning (HP) technique is a logical database design technique first developed for distributed relational (record structured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we develop a cost model for query processing in object oriented databases (OODBs) for both unpartitioned and horizontally partitioned object oriented databases. The problem of coming up optimal HP scheme is NP-complete. Therefore, we present and evaluate two algorithms for coming up with optimal (based on exhaustive search) and/or near optimal (based on heuristics) HP schemes. 1 Introduction OODB technology has matured enough to support modern applications such as CAM/CAD, software engineering and multimedia databases. HP is often used as a means to achieve better performance out of database sys...

Citations