Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity

Details Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity

2007-05-02

arxiv.org/abs/0705.0281v1

LNCS, Vol. 1944 (06/2000) 71-85

Computer Science

Databases

Scientific paper

We present in this paper three dynamic clustering techniques for Object-Oriented Databases (OODBs). The first two, Dynamic, Statistical & Tunable Clustering (DSTC) and StatClust, exploit both comprehensive usage statistics and the inter-object reference graph. They are quite elaborate. However, they are also complex to implement and induce a high overhead. The third clustering technique, called Detection & Reclustering of Objects (DRO), is based on the same principles, but is much simpler to implement. These three clustering algorithm have been implemented in the Texas persistent object store and compared in terms of clustering efficiency (i.e., overall performance increase) and overhead using the Object Clustering Benchmark (OCB). The results obtained showed that DRO induced a lighter overhead while still achieving better overall performance.

Affiliated with

Also associated with

No associations

Rating

Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Clustering in Object-Oriented Databases: An Advocacy for Simplicity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674787