Skip to main content
SpringerLink
Log in

IO2 an algorithmic method for building inheritance graphs in object database design

  • Session 9: Capturing Design Information
  • Conference paper
  • First Online:
Conceptual Modeling — ER '96 (ER 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1157))

Included in the following conference series:

Abstract

This paper proposes a method, called iO2, for building the inheritance graph of an O2 database schema. The iO2 method is based on the Galois lattice data structure. It encompasses three steps: a (first) construction step, a (second) optimization step, and a (final) generation step. This paper focuses on the two first steps.

The construction step builds the Galois graph of the finite binary relation associating properties to entity and relationship types. A new algorithm is proposed for this first step. The optimization step builds the Galois inheritance graph from the Galois graph. A new algorithm is proposed for this second step in order to eliminate the redundancies. The generation step yields the O2 inheritance graph from the Galois inheritance graph. The transformation principles underlying this third step are given. The detailed generation algorithm is presented in [Yah96a].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Adiba, and C. Collet,“Objets et bases de données: le SGBD O2”. Ed. Hermes, 1993.

    Google Scholar 

  2. E. Amiel, M. J. Bellosta, E. Dujardin, and E. Simon,“Supporting exceptions to behavioral schema consistency to ease schema evolution in OODMS”. In Proceedings of the 20th International Conference on Very Large Databases-VLDB94., Chile 1994, pp. 108–119.

    Google Scholar 

  3. P. Baptiste, and J. Favrel, “Résolution de problèmes d'ordonnancement par les treillis de Galois et les graphes d'intervalle”. RAIRO-Automatique/Systems Analysis and Control, 1984, Vol. 18, Nℴ 4, pp. 405–416.

    Google Scholar 

  4. S. Bergamashi, and C. Sartori, “On taxonomic reasoning in conceptual design”. ACM Transactions on Database Systems, Vol. 17, Nℴ 3, September 1992, pp. 385–422.

    Google Scholar 

  5. G. Booch,“Object-oriented design with applications”. Benjamin/ Cumming Company, 1991.

    Google Scholar 

  6. J. P. Bordat, “Calcul pratique du treillis de Galois d'une correspondance”. Mathématiques et Sciences Humaines, Nℴ 96, 1986, pp. 31–47.

    Google Scholar 

  7. J.P. Bordat,“L'algorithmique combinatoire d'ordres finis”. Phd Thesis, Université de Montpellier II, 1992.

    Google Scholar 

  8. R. J. Brachman,“What ISA is and isn't”. Analysis of Taxonomic Links in semantic Network, Computer Nℴ10, 1983.

    Google Scholar 

  9. L. Cardelli,“A semantics of multiple inheritance”. Readings in Object-Oriented Database Systems, S. B. Zdonik and D. Maier (Eds.), 1990. pp. 51–67.

    Google Scholar 

  10. C. Carpineto, and G. Romano,“GALOIS: An order-theoretic approach to conceptual clustering”. Proceedings of the Machine Learning Conference, 1993, pp. 33–40.

    Google Scholar 

  11. P. Coad, and E. Yourdon,“ Object-oriented analysis”. Yourdon Press Computing Series, 1990.

    Google Scholar 

  12. W. R. Cook, and J. Palsberg,“A denotational semantics of inheritance and its correctness”. In proceedings of the International Conference On Object-Oriented Programming Languages and Applications-OOPSLA89, 1989, pp. 433–443.

    Google Scholar 

  13. W. R. Cook,“Interfaces and specifications for the smaltalk-80 collection class”. In proceedings of the International Conference On Object-Oriented Programming Languages and Applications-OOPSLA92, 1992, pp. 1–15.

    Google Scholar 

  14. C. Delcourt, and R. Zicari, “The design of an integrity consistency checker (ICC) for an object oriented database system”. European Conference on Object Oriented Programming-ECOOP 91. LNCS Nℴ 512, Geneva, Switzerland, July 1991. pp. 97–117.

    Google Scholar 

  15. R. Ducournau, M. Habib, M. Huchard, and M. L. Mugnier,“Monotonic conflict resolution mechanisms for inheritance”. In proceedings of the International Conference On Object-Oriented Programming Languages and Applications-OOPSLA92, 1992, pp. 16–24.

    Google Scholar 

  16. A. Formica, and M. Missikoff, “Correctness of ISA hierarchies in object-oriented database schemas”. In proceedings of the 4th International Conference on Extending Database Technology-EDBT 94, LNCS Nℴ 779, Cambridge, United Kingdom, March 1994, pp. 231–244.

    Google Scholar 

  17. R. Godin, and H. Mili,“Building and maintaining analysis-level class hierarchies using Galois lattices”. In proceedings of the International Conference On Object-Oriented Programming Languages and Applications-OOPSLA 93, 1993, pp. 394–410.

    Google Scholar 

  18. R. Godin, G. Mineau, R. Missaoui, and H. Mili, “Conceptual clustering methods based on Galois lattices and applications”. French Review on Artificial intelligence, Vol. 9, Nℴ 2, 1995, pp. 105–137.

    Google Scholar 

  19. R. Godin, G. W. Mineau, and R. Missaoui,“Incremental structuring of knowledge bases”. In proceedings of the International KRUSE Symposium, Callifornia, 1995, pp. 179–193.

    Google Scholar 

  20. R. Godin, R. Missaoui, and H. Alaoui, “Incremental concept formation algorithms based on Galois (concept) lattices”. In Computational Intelligence, Vol. 11, Nℴ2, 1995, pp. 246–265.

    Google Scholar 

  21. A. Guénoche, “Construction du treillis de Galois d'une relation binaire”. Mathématiques et Sciences Humaines, Nℴ 109, 1990, pp. 41–53.

    Google Scholar 

  22. R. Johnson, and B. Foote,“Designing reusable classes”. Journal of Object-Oriented Programming, June/July, 1988, pp-22–35.

    Google Scholar 

  23. T. Korson, and J. D. McGregor,“Technical criteria for the specification and evaluation of object-oriented Libraries”. Software Engineering Journal, March 1992, pp. 85–94.

    Google Scholar 

  24. C. Lécluse, P. Richard, and F. Velez“ O2, an object-oriented data model”. In proceedings of the ACM SIGMOD International Conference On Management of Data. June 1988, pp. 424–433.

    Google Scholar 

  25. K.J. Lieberherr, P.Bergstein, and I.Silvalep,“From objects to classes: algorithms for optional object-oriented design”. Journal of Software Engineering. July 1991, pp. 205–228.

    Google Scholar 

  26. M. Missikoff, and M. Scholl, “An algorithm for insertion into a lattice: application to type classification”. Foundations of Data Organization and Algorithms, 3rd International Conference-FODO89, Paris, France, June 1989, LNCS Nℴ 367, pp. 64–82.

    Google Scholar 

  27. P. Poncelet, M. Teisseire, R. Cicchetti, and L. Lakhal,“Towards a formal approach for object-oriented database design”. In Proceedings of the 19th International Conference on Very Large Databases-VLDB 93, Dublin, Ireland. August 1993, pp. 278–289.

    Google Scholar 

  28. J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, and W. Lorensen, “Object oriented modeling and design”. Prentice Hall, 1991.

    Google Scholar 

  29. R. Taouil, L. Lakhal, and J.P. Bordat, “Evolutive building of Galois lattices”. Technical Report of LIMOS, Clermont-Ferrand University, Avril 1996.

    Google Scholar 

  30. R. Wille,“Restructuring lattice theory: An Approach Based on Hierarchies of Concepts”. In Ordered Sets, I. Rival (Eds.), 1982, pp. 445–470.

    Google Scholar 

  31. R. Wille, “Concept lattices and conceptual knowledge systems”. Computers Math. Applications Vol. 23, No. 6–9, 1992, pp. 493–515.

    Google Scholar 

  32. A. Yahia,“Restructuring the Galois inheritance graph”. Technical Report of LIMOS, Clermont-Ferrand University, September 1995.

    Google Scholar 

  33. A. Yahia, L. lakhal, and R. Cicchetti, “Building inheritance graphs in object database design”. DEXA' 96 Conference, Zurich, 9th–13th September 1996.

    Google Scholar 

  34. A. Yahia, L. lakhal, R. Cicchetti, and J. P. Bordat,“Conceptual modelling and design of class hierarchies in object database design”. In revision stage for The Computer Journal, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Complexe Scientifique des Cézeaux, LIMOS, 63177, Aubière Cedex, France

    A. Yahia & L. Lakhal

  2. Case 901, Faculté des sciences de Luminy, 163 Av. de Luminy, 13288, Marseille Cedex9, France

    R. Cicchetti

  3. LIRMM, 161 rue ADA, 34392, Montpellier cedex 5, France

    J. P. Bordat

Authors
  1. A. Yahia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Lakhal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Cicchetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. J. P. Bordat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yahia, A., Lakhal, L., Cicchetti, R., Bordat, J.P. (1996). IO2 an algorithmic method for building inheritance graphs in object database design. In: Thalheim, B. (eds) Conceptual Modeling — ER '96. ER 1996. Lecture Notes in Computer Science, vol 1157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019938

Download citation

  • DOI: https://doi.org/10.1007/BFb0019938

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61784-6

  • Online ISBN: 978-3-540-70685-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation