Cost-driven evaluation of vertical partitioning in object-oriented databases

Vertical partitioning is a proven database design technique which increases the efficiency of query execution by reducing the irrelevant data accesses. In this paper, we develop a cost model to study the effectiveness of vertical partitioning in OODBs, in terms of reducing the number of disk accesses for executing a set of queries. Further, we compare and evaluate two different (namely, affinity-based, and cost-driven) partitioning approaches. We shown that the cost-driven approach is more general and more effective in reducing number of irrelevant disk accesses accessed than the affinity-based approach