On the Estimation of Query Execution Time in Object-Oriented Databases at the Early Design Stages.
Aleksey V. Burdakov, Yuri A. Grigorev, Andrey Ploutenko · 2002
Abstract. Due to the complexity of modern object-oriented database management systems ’ (OODBMS) query execution processes it is rather hard for a system designer to predict performance characteristics of an information system under development at the early design stages. This paper proposes novel mathematical model and methods for evaluation of query execution time for OODBMS. These methods provide estimation equations for two basic n-ary algorithms employed in OODBMS: Forward Join and Reverse Join. The proposed methods are based on Generating Functions and Laplace-Stieltjes Transform apparatus, and allow to use arbitrary distribution functions for the definition of query execution algorithm’s and database objects ’ parameters (number of objects, predicate selectivity, index scan time, etc.). For some degenerate cases corresponding corollaries are obtained with simplified equations. Database page organisation is addressed by equations which extend Yao’s formula for arbitrary distributions. 1