Indexing Techniques for Queries on Nested Objects

IEEE Transactions on Knowledge and Data Engineering

Volumn 1, Issue 2, 1989, Pages 196-214

  Bertino, Elisa ^a   Kim, Won ^a  

^a Microelectronics Computer Technology Corporation   (United States)

Author keywords

Access methods; complex objects; database performance and measurement; index selection; nested relations; object oriented databases; query optimization

Indexed keywords

COMPUTER METATHEORY--BOOLEAN FUNCTIONS; DATA PROCESSING--DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; INFORMATION SCIENCE--INDEXING;

ACCESS METHODS; NESTED RELATIONAL DATABASE; OBJECT ORIENTED DATABASES; QUERY OPTIMIZATION; RETRIEVAL COSTS; UPDATE COSTS;

DATABASE SYSTEMS;

EID: 0024686488     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.87960     Document Type: Article

References (19)

1. S.Abiteboul, N.Bidoit “Non first normal form relations to represent hierarchically organized dat”Proc. ACM SIGACT-SIGMOND Symp. Principles of Database Syst. PP.191-200, oct. 1984
2. T. Andrews and C. Harris, “Combining language and database advances in an object-oriented development environment,” in Proc. 2nd Int. Conf. Object-Oriented Programming Syst. Languages, Appl., Orlando, FL, Oct. 1987, pp. 430–440.
3. J. Banerjee, H. T. Chou, J. Garza, W. Kim, D. Woelk, N. Ballou, and H. J. Kim, “Data model issues for object-oriented applications,” ACM Trans. Office Inform. Syst., vol. 5, pp. 3–26, 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. D. Comer, “The ubiquitous B-tree,” ACM Comput. Surveys, vol. 11, pp. 121–137, June 1979.
7. P. Dadam et al., “A DBMS prototype to support extended NF2 relations: An integrated view on flat tables and hierarchies,” in Proc. ACM SIGMOD Int. Conf. Management of Data, Washington, DC, May 1986, pp. 356–366.
8. D. Deshpande and D. Van Gucht, “An implementation for nested relational databases,” in Proc. Int. Conf Very Large Data Bases, Los Angeles, CA, Aug. 1988, pp. 76–87.
9. D. H. Fishman et 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. Khoshafian and G. Copeland, “Object identity,” in Proc. 1st Int. Conf. Object-Oriented Programming Syst., Languages Appl., Portland, OR, Oct. 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,” in Object-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,” in Proc. Int. Workshop Object-Oriented Database Syst., Asilomar, CA, Sept. 23–26, 1986, pp. 171–182.
16. D. Maier et al., “Development of an object-oriented DBMS,” in Proc. 1st Int. Conf. Object-Oriented Programming Syst. Languages, Appl., Portland, OR, Oct. 1986, pp. 472–482.
17. [17] A. Makinouchi, “A consideration of normal form of not-necessarily normalized relations in the relational data model,” in Proc. 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,” ACM Commun., vol. 20, pp. 260–261, Apr. 1977.