A Cost Model for Clustered Object-Oriented Databases

Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most efficient execution plans. In this paper we propose and partially validate a generic cost-model for Object-Oriented DBMSs. The storage model and its access methods support clust,ered and nested collections, links, and path indexes. Queries may involve complex predicates with qualified path expressions. We propose a, method for estimating the number of block a,ccesses to clustered collections and a paramet,erized execution model for evaluating predicat,es. We estimate the costs of path expression traversals in different cases of physical clustering of the supporting collections. Thr model is validated through experiments with the 02 DBMS.

[1]  Laurent Amsaleg,et al.  Object Grouping in Eos , 1992, IWDOM.

[2]  Goetz Graefe,et al.  Experiences building the open OODB query optimizer , 1993, SIGMOD Conference.

[3]  Georges Gardarin,et al.  A Rule-Based Query Optimizer with Multiple Search Strategies , 1994, Data Knowl. Eng..

[4]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[5]  Stanley B. Zdonik,et al.  Control of an Extensible Query Optimizer: A Planning-Based Approach , 1993, VLDB.

[6]  Elisa Bertino,et al.  An Analytical Model of Object-Oriented Query Costs , 1992, POS.

[7]  Yannis E. Ioannidis,et al.  Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.

[8]  Goetz Graefe,et al.  The Volcano optimizer generator: extensibility and efficient search , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[9]  Gregory Piatetsky-Shapiro,et al.  Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.

[10]  Georg Lausen,et al.  Access to Objects by Path Expressions and Rules , 1994, VLDB.

[11]  Patrick Valduriez,et al.  Extending the Search Strategy in a Query Optimizer , 1991, VLDB.

[12]  Véronique Benzaken,et al.  Enhancing Performance in a Persistent Object Store: Clustering Strategies in O2 , 1990, POS.

[13]  Hamid Pirahesh,et al.  Extensible query processing in starburst , 1989, SIGMOD '89.

[14]  François Bancilhon,et al.  A query language for the O 2 object-oriented databases , 1989 .

[15]  Arun N. Swami.  A Validated Cost Model for Main Memory Databases , 1989, SIGMETRICS.

[16]  Sophie Cluet,et al.  A general framework for the optimization of object-oriented queries , 1992, SIGMOD '92.

[17]  Ismailcem Budak Arpinar,et al.  METU object-oriented DBMS , 1994, SIGMOD '94.

[18]  Mohamed Zait.  Optimisation de requetes relationnelles pour execution parallele , 1994 .

[19]  S. B. Yao,et al.  Approximating block accesses in database organizations , 1977, CACM.

[20]  Michael V. Mannino,et al.  Statistical profile estimation in database systems , 1988, CSUR.

[21]  ZhaoHui Tang,et al.  Cost-based Selection of Path Expression Processing Algorithms in Object-Oriented Databases , 1996, VLDB.

[22]  Elisa Bertino,et al.  Indexing Techniques for Queries on Nested Objects , 1989, IEEE Trans. Knowl. Data Eng..

[23]  R. G. G. Cattell,et al.  The Object Database Standard: ODMG-93 , 1993 .

[24]  Darrell Woelk,et al.  Query Processing in Distributed ORION , 1990, EDBT.

[25]  Goetz Graefe,et al.  The Volcano Optimizer Generator , 1991, ICDE 1991.

[26]  David Jordan,et al.  The Object Database Standard: ODMG 2.0 , 1997 .