Dynamic reorganization of object databases

We consider the problem of optimizing the number of I/O operations by means of an effective clustering, with the objective to overcome deficiencies of existing solutions. Our main objective is to dynamically adapt physical database organizations, online, according to the access patterns of the users without adding significant overhead on processing workload. We propose a clustering schedule that may be convenient for any object database management systems (ODBMS); it combines flexibility, dynamics, and efficiency. The paper describes relative partial validation of our approach using Versant.

[1]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[2]  Mehmet A. Orgun,et al.  VERSANT architecture: supporting high-performance object databases , 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

[3]  Dennis Tsichritzis,et al.  Advances in Database Technology — EDBT '90 , 1990, Lecture Notes in Computer Science.

[4]  Randy H. Katz,et al.  Exploiting inheritance and structure semantics for effective clustering and buffering in an object-oriented DBMS , 1989, SIGMOD '89.

[5]  Giuseppe Cattaneo,et al.  An empirical study of dynamic graph algorithms , 1996, SODA '96.

[6]  Don S. Batory Optimal file designs and reorganization points , 1982, TODS.

[7]  Vlad Ingar Wietrzyk Performance Evaluation of New Clustering Algorithm in Object-Oriented Database Systems , 1996, DEXA.

[8]  David J. DeWitt,et al.  A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems , 1990, VLDB.

[9]  François Bancilhon,et al.  Building an Object-Oriented Database System, The Story of O2 , 1992 .

[10]  Ali R. Hurson,et al.  Effective clustering of complex objects in object-oriented databases , 1991, SIGMOD '91.

[11]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[12]  T. Lougenia Anderson,et al.  The HyperModel Benchmark , 1990, EDBT.

[13]  Philip N. Klein,et al.  A randomized linear-time algorithm for finding minimum spanning trees , 1994, STOC '94.

[14]  Randy H. Katz,et al.  Inheritance in computer-aided design databases: semantics and implementation issues , 1990, Comput. Aided Des..

[15]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.