Signature File Methods for Indexing Object-oriented Database Systems

Although object-oriented database systems ooer more powerful modeling capability than relational database systems, their performance suuers from the increased complexity in the data model. Thus, eecient index mechanisms must be used to improve the performance. In this paper, two new signature methods for indexing object-oriented databases and the associated operations are described. The cost models for the analysis of storage overhead and performance of the methods are presented.

[1]  C.S. Roberts,et al.  Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.

[2]  David Maier,et al.  Indexing in an Object-Oriented DBMS , 1986, OODBS.

[3]  Won Kim,et al.  Integrating an object-oriented programming system with a database system , 1988, OOPSLA '88.

[4]  Jay Banerjee,et al.  Integrating an object-oriented programming system with a database system , 1988, OOPSLA 1988.

[5]  Elisa Bertino,et al.  Indexing Techniques for Queries on Nested Objects , 1989, IEEE Trans. Knowl. Data Eng..

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

[7]  O. Deux,et al.  The Story of O2 , 1990, IEEE Trans. Knowl. Data Eng..

[8]  Elisa Bertino,et al.  An indexing techniques for object-oriented databases , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[9]  Object-Oriented Data,et al.  An Indexing Technique for Object-Oriented Databases , 1991 .

[10]  O. Deux,et al.  The story of O 2 , 1992 .