Performance evaluation of new clustering algorithm in object-oriented database systems
It is widely acknowledged that clustering is a cornerstone for the performance of database management systems. In particular, object-oriented databases have properties which may compromise the effectiveness of a clustered structure, i.e., object updates and multiple relationships. The clustering problem consists in finding a partition of the set of the objects in the database. Our approach is similar to the one adopted in Schkolnick  for the hierarchical model. When objects are grouped together, it is desirable that these objects be accessed together in the future. We have an operational approach: we will evaluate the benefits of our clustering strategy and show how to dynamically adapt it.
KeywordsObject databases clustering strategy software engineering
Unable to display preview. Download preview PDF.
- M. Schkolnick: A clustering algorithm for hierarchical structures. ACM TODS 2(1), 1977.Google Scholar
- P. Valduriez, S. Khoshafian, and G. Copeland: Implementation techniques of complex objects. In Proceedings of the 12th International Conference on Very Large Data Bases. San Mateo, CA, Morgan Kaufmann, 1986.Google Scholar
- W. Kim, J. Banerjee, H. Chou, J. Garza, and D. Woelk: Composite objects support in an object-oriented database system. In Proceedings of the OOPSLA'87 Conference, 1987.Google Scholar
- M. O. Albertson, J. P. Hutchinson: Discrete Mathematics with Algorithms, John Wiley & Sons, 1988.Google Scholar