Clustering techniques for object-oriented database systems

The authors conduct an analysis to compare three clustering strategies, Cactis, ORION, and CK, in terms of space and time overhead. They also examine the level, page, or segment at which clustering should take place. The dynamic clustering technique CK is found to be best in exploiting the structural relationships between objects and inheritance semantics to identify an efficient storage scheme. However, it creates high overhead and is best suited for applications in which the read/write ratio is high. To remove this limitation, the authors show how segment clustering, instead of page clustering, could reduce the number of cases where a page split is necessary.<>