Estimating nested selectivity in object-oriented databases

A searc h condition in object-oriented queries consists of nested predicates, eac h of which is a predicate on a path expression. In this paper, w e present a new selectivit y estimation technique for nested predicates. Selectivity of a nested predicate, neste d selectivity, is de ned as the ratio of the number of quali ed objects of the starting class in the path expression to the total number of objects of the class. The new technique takes into account the e ects of direct representation of manyto-many relationships. Many-to-many relationships frequently occur in object-oriented databases, but have not been properly handled in con ven tionalselectivit yestimation techniques. F or many-to-many relationships, we generalize the block-hit function originally proposed by B. Yao allowing the cases where one object belongs to more than one block. The most signi cant advantage of our technique is that the accuracy of the estimation is far enhanced with only a small additional overhead. We present an e cient method for obtaining the statistical information that is needed for our estimation technique. We analyze the accuracy of our estimation technique and compare the result with those of conven tional ones. The experimental result shows there is a signi cant deviation in the estimation obtained by conven tional ones, con rming the advan tage of our technique.

[1]  Stavros Christodoulakis,et al.  Implications of certain assumptions in database performance evauation , 1984, TODS.

[2]  Won Kim,et al.  Acyclic Query Processing in Object-Oriented Databases , 1988, ER.

[3]  Prashant Palvia,et al.  Approximating Block Accesses in Database Organizations , 1984, Inf. Process. Lett..

[4]  Gio Wiederhold,et al.  Separability —An Approach to Physical Database Design , 1984, IEEE Transactions on Computers.

[5]  Michael J. Carey,et al.  A performance evaluation of pointer-based joins , 1990, SIGMOD '90.

[6]  Sang Hyuk Son,et al.  A New Method for Estimating the Number of Objects Satisfying an Object-Oriented Query Involving Partial Participation of Classes , 1996, Inf. Syst..

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

[8]  Guido Moerkotte,et al.  Optimizing disjunctive queries with expensive predicates , 1994, SIGMOD '94.

[9]  Kyu-Young Whang,et al.  A linear-time probabilistic counting algorithm for database applications , 1990, TODS.

[10]  Elisa Bertino,et al.  On Modeling Cost Functions for Object-Oriented Databases , 1997, IEEE Trans. Knowl. Data Eng..

[11]  Michael Kifer,et al.  Querying object-oriented databases , 1992, SIGMOD '92.

[12]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[13]  Donald D. Chamberlin,et al.  Access Path Selection in a Relational Database Management System , 1989 .

[14]  Won Kim,et al.  Introduction to Object-Oriented Databases , 1991, Computer systems.

[15]  Elisa Bertino,et al.  Index configuration in object-oriented databases , 1994, VLDB J..