This Article 
 Bibliographic References 
 Add to: 
On Modeling Cost Functions for Object-Oriented Databases
May-June 1997 (vol. 9 no. 3)
pp. 500-508

Abstract—In this paper, we present a set of parameters able to exactly model topologies of object references in object-oriented databases. These parameters are important since they are used to model query execution strategy costs for optimization. The model we present considers also the cases of multivalued attributes and null references. Moreover, a set of derived parameters are introduced and their mathematical derivations are shown. These derived parameters are important, since they allow selectivity of nested predicates to be estimated. Moreover, they are used in estimating storage, access, and update costs for a number of access structures specifically tailored to efficiently support object-oriented queries.

[1] S. Abiteboul and P.C. Kanellakis,“Object identity as a query language primitive,” Proc. 1989 ACM SIGMOD Int’l Conf. the Management of Data, SIGMOD Record, vol. 18, no. 2, pp. 159-173, June 1989.
[2] J. Banerjee, W. Kim, and K.-C. Kim, “Queries in Object-Oriented Databases,” Proc. Fourth Int'l Conf. Data Eng., 1988.
[3] E. Bertino and W. Kim, “Indexing Technique for Queries on Nested Objects,” IEEE Trans. Knowledge and Data Eng., vol. 1, no. 2, pp. 196-214, 1989.
[4] E. Bertino, "Query Optimization Using Nested Indices," Proc. Second Int'l Conf. Extending Database Technology (EDBT),Venice, Italy, Mar.26-30, 1990, Lecture Notes in Computer Sciences 416, Springer-Verlag.
[5] E. Bertino and L. Martino,Object-Oriented Database Systems. Int’l Computer Science Series. Addison-Wesley, 1993.
[6] E. Bertino,M. Negri,G. Pelagatti,, and L. Sbattella,“Object-oriented query languages: The notion and the issues,” IEEE Trans. Knowledge and Data Eng., vol. 4, no. 3, pp. 223-237, 1992.
[7] E. Bertino, G. Guerrini, and D. Montesi, "Towards Deductive Object Databases," J. Theory and Practice of Object Systems, vol. 1, no. 1, pp. 19-39. John Wiley&Sons, 1995.
[8] E. Bertino and P. Foscoli, "Index Organizations for Object-Oriented Database Systems," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 2, pp. 193-209, 1995.
[9] R. Bretl et al., "The GemStone Data Management System." Object-Oriented Concepts, Applications, and Databases, W. Kim, and F. Lochovsky, eds. Addison-Wesley, 1989.
[10] Special section on next-generation database systems, Comm. ACM, vol. 34, no. 10, Oct. 1991.
[11] M. Carey and D. DeWitt, "An Overview of the EXODUS Project," Proc. ACM-SIGMOD Conf. Management of Data,Chicago, June 1988.
[12] R. Cattell, Object Data Management. Addison-Wesley, 1994.
[13] S. Chawate, M.S. Chen, and P. Yu, "On Index Selection Schemes for Nested Object Hierarchies," Proc. 20th VLDB Conf., Aug. 1994.
[14] C.M. Chen and N. Roussopoulos, "Adaptive Selectivity Estimation Using Query Feedback," Proc. ACM SIGMOD Conf., pp. 161-172, May 1994.
[15] O. Dexu et al., "The Story of O2," IEEE Trans. Knowledge and Data Eng., pp. 91-108, Mar. 1990.
[16] M. Gyssens,J. Paredaens,, and D. Van Gucht,“A graph-oriented object database model,” Proc. Ninth ACM Symp. Principles of Database Systems, pp. 417-424, Apr. 1990.
[17] Y. Lou and Z.M. Ozsoyoglu, “LLO: An Object-Oriented Deductive Language with Methods and Method Inheritance,” Proc. ACM SIGMOD Conf., 1991.
[18] Y.E. Ioannidis and S. Christodoulakis, “On the Propagation of Errors in the Size of Join Results,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 268-277, 1991.
[19] P. Jenq, D. Woelk, W. Kim, and W.L. Lee, "Query Processing in Distributed ORION," MCC Technical Report no. ACA-ST-035-89, Jan. 1989.
[20] A. Kemper and G. Moerkotte, “Access Support in Object Bases,” Proc. ACM-SIGMOD Int'l Conf. Management of Data, pp. 364-374, 1990.
[21] M. Kifer and G. Lausen, “F-Logic: A Higher-Order Language for Reasoning About Objects, Inheritance, and Scheme,” Proc. ACM SIGMOD Conf., 1989.
[22] W. Kin,“A model of queries for object-oriented databases,” Proc. 15th Int’l Conf. Very Large Databases, pp. 423-432, 1989.
[23] W. Kim, “Object-Oriented Databases: Definition and Research Directions,” IEEE Trans. Knowledge and Data Eng., vol. 2, no. 3, pp. 327-341, Sept. 1990.
[24] P. Selinger,D. Astrahan,D. Chamberlin,R. Lorie,, and T. Price,“Access path selection in a relational database management system,” Proc. 1979 ACM-SIGMOD Int’l Conf. Management of Data, pp. 23-34,Boston, May 1979.
[25] G.M. Shaw and S.B. Zdonik, “An Object-Oriented Query Algebra,” Proc. Second Int'l Workshop Database Programming Languages (DBPL '89), June 1989.
[26] B. Sreenath and S. Seshadri, "The hcC-Tree: An Efficient Index Structure for Object Oriented Databases," Proc. 20th VLDB Conf., Aug. 1994.
[27] W. Sun, Y. Ling, N. Rishe, and Y. Deng, "An Instant and Accurate Size Estimation Method for Joins and Selections in a Retrieval-Intensive Environment," Proc. SIGMOD, pp. 79-88, 1993.
[28] Z. Xie and J. Han, “Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases,” Proc. 1994 Int'l Conf. Very Large Data Bases, pp. 522-533, Sept. 1994.
[29] C. Zaniolo, "Object Identity and Inheritance in Deductive Databases—An Evolutionary Approach," Proc. First Int'l Conf. Deductive and Object-Oriented Databases (DOOD),Kyoto, Japan, Dec.4-6, 1989.

Index Terms:
Object-oriented databases, complex objects, inheritance, query languages, query processing, data structures.
Elisa Bertino, Paola Foscoli, "On Modeling Cost Functions for Object-Oriented Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 500-508, May-June 1997, doi:10.1109/69.599936
Usage of this product signifies your acceptance of the Terms of Use.