By Topic

Clustering techniques for object-oriented database systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chabridon, S. ; Sch. of Comput. Sci., Oklahoma Univ., Norman, OK, USA ; Liao, J.-C. ; Ma, Y. ; Gruenwald, L.

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.<>

Published in:

Compcon Spring '93, Digest of Papers.

Date of Conference:

22-26 Feb. 1993