This Article 
 Bibliographic References 
 Add to: 
Indexing Techniques for Queries on Nested Objects
June 1989 (vol. 1 no. 2)
pp. 196-214

Three index organizations are introduced for use in the evaluation of a query in an object-oriented or nested relational database. Detailed models of the three indexes are developed. Using the models, the storage cost, retrieval cost, and update cost of these indexes are evaluated, and a number of observations are made about the use of these indexes for evaluating queries for object-oriented or nested relational databases. A comparison of the combined retrieval and update costs for the three indexes is also included. It is shown that the degree of reference sharing among objects for the various classes in the path influences both the retrieval and update costs.

[1] S. Abiteboul and N. Bidoit, "Non-first normal form relations to represent hierarchically organized data," inProc. 3rd ACM Conf. on Principle of Database Syst.(Waterloo, ON, Canada), 1984 (also published inJ. Comput. Syst. Sci., vol. 33, 1986.)
[2] T. Andrews and C. Harris, "Combining Language and Database Advances in Object-Oriented Development Environment,"Proc. Object-Oriented Programming Systems, Languages, and Applications, Addison-Wesley, Reading, Mass., 1987, pp. 430- 440; alsoSIGPlan Notices, special issue, ACM, Vol. 22, No. 12, Dec. 1987.
[3] J. Banerjeeet al., "Data model issues for object-oriented applications,"ACM Trans. Office Information Systems, Jan. 1987.
[4] R. Bayer and E. McCreight, "Organization and maintenance of large ordered indexes,"Acta Inform., vol. 1, pp. 173-189, 1972.
[5] E. Bertino, "On index configurations in object-oriented databases," document in preparation, 1989.
[6] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[7] P. Dadamet al., "A DBMS prototype to support extended NF2 relations: An integrated view on flat tables and hierarchies," inProc. ACM SIGMOD, 1986, pp. 356-367.
[8] D. Deshpande and D. Van Gucht, "An implementation for nested relational databases," inProc. Int. Conf. Very Large Data Bases, Los Angeles, CA, Aug. 1988, pp. 76-87.
[9] D. H. Fishmanet al., "IRIS: An object-oriented database management system,"ACM Trans. Office Inform. Syst., vol. 5, pp. 48-69, Jan. 1987.
[10] SQL/Data System: Concepts and Facilities. GH24-5013-0, File No. S370-50, IBM Corp., Jan. 1981.
[11] IEEE Computer Society,Database Engineering(Special Issue on Non-First Normal Form Relational Databases), Z. M. Ozsoyoglu, Ed., Sept. 1988.
[12] S. N. Koshafian and G. P. Copeland, "Object identity,"SIGPLAN Notices (Proc. ACM Conf. Object-Oriented Programming Systems, Languages and Applications (OOPSLA)), vol. 21, no. 11, pp. 417- 423, 1986.
[13] W. Kim, "A foundation for object-oriented databases," MCC Tech.- Rep., ACA-ST-248-88, Aug. 1988.
[14] W. Kim, K. C. Kim, and A. Dale, "Indexing techniques for object-oriented databases," inObject-Oriented Concepts, Applications, and Databases, W. Kim and F. Lochovsky, Eds. Reading, MA: Addison-Wesley, 1989.
[15] D. Maier and J. Stein, "Indexing in an object-oriented DBMS," inProc. Int. Workshop Object-Oriented Database Syst., Asilomar, CA, Sept. 23-26, 1986, pp. 171-182.
[16] D. Maieret al., "Development of an object-oriented DBMS," inProc. ACM OOPSLA'86, pp. 472-482, 1986.
[17] A. Makinouchi, "A consideration of normal form of not-necessarily normalized relations in the relational data model," inProc. Int. Conf. Very Large Data Bases, 1977, pp. 447-453.
[18] M. Schkolnick and P. Tiberio, "Estimating the cost of updates in a relational database,"ACM Trans. Database Syst., vol. 10, pp. 163- 179, June 1985.
[19] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.

Index Terms:
query evaluation; object-oriented database; indexing techniques; queries; nested objects; index organizations; nested relational database; storage cost; retrieval cost; update cost; reference sharing; indexing; information retrieval; relational databases
E. Bertino, W. Kim, "Indexing Techniques for Queries on Nested Objects," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 196-214, June 1989, doi:10.1109/69.87960
Usage of this product signifies your acceptance of the Terms of Use.