An Incremental and Semi-automatic Method Inheritance Graph Hierarchy Construction

  • Mohamed M. Gammoudi
  • Ibtissem Nafkha
  • Zair Abdelouahab
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1728)


In [16] we proposed a semi automatic method for generating inheritance graph hierarchy to assist the designer during the definition of a conceptual schema. The motivation of this work was the very few approaches which attempt to provide methods and tools for designing inheritance graph in object databases [30], and object software[1]. To address some limitations found in our work, we propose a new method whose principles are: (i) From a binary relation which represents the links between entities and their properties and methods, our proposed heuristic generates and organizes incrementally a set of Optimal rectangles into a Brute Inheritance Graph (BIG). (ii) BIG is refined and submitted to the designer. (iii) The designer can modify, add or remove classes, attributes or methods in the binary relation and activates steps (i) until he obtains a proper class hierarchy or an Optimal Inheritance Graph.


Conceptual Schema Class Inheritance Graph Hierarchy Binary Relation Incremental and Rectangular Decomposition Optimal Rectangle 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. Bibliography

  1. [1]
    Ann L. Winblad, Samuel d. Edwaards, David R. King-“Object-Oriented Software”: Addison-Wesley, 1990.Google Scholar
  2. [2]
    M. Armstrong, Richard J. Mitchell, “Uses and Abuses of Inheritance” Journal Enginnering Software, Vol 9 (1) 19–26, Jan 1994CrossRefGoogle Scholar
  3. [3]
    M. Barbut, B. Monjardet, «Ordre et classification», Algèbre et combinatoire, Tome II, 1970, Hachette.Google Scholar
  4. [3]
    H. Belaid, Ali Jaoua, “Abstraction of Objects by Conceptual Clustering”, In proceeding of Joint Conference on Information Sciences, Durham, USA, 1997.Google Scholar
  5. [4]
    N. Belkhiter, C. Bourhfir, M.M. Gammoudi, A. Jaoua, N. Le Thanh, M. Reguig, «Architecture rectangulaire optimale d’une base documentaire indexée», Université Laval, Département d’Informatique (Rapport de Recherche), DIUL-RR-9201, 1992.Google Scholar
  6. [5]
    N. Belkhiter, C. Bourhfir, M.M. Gammoudi, A. Jaoua, N. Le Thanh, M. Reguig «Décomposition Rectangulaire Optimale d’une Relation Binaire: Application aux Bases de Données Documentaires». Information Systems and Operational Research Journal, 32 (1): 33–54, 1994.zbMATHGoogle Scholar
  7. [6]
    N. Belkhiter, J. Desharnais, G. Ennis, A. Jaoua, H. Ounalli, M.M. Gammoudi, “Formal Properties of Rectangular Relations”. In Proceeding of the Ninth International Symposium on Computer and Information Science, ISCIS IX, Antalya, Turkey, November 7–9, 1994.Google Scholar
  8. [7]
    G. Booch, “Object-Oriented Analisys and Design with Applications”, Second Edition-The Benjamin/Cummings Publishing Company, Inc.1994.Google Scholar
  9. [8]
    J.P. Bordat, «Sur l’algorithmique combinatoire d’ordre finis», Thèse de Doctorat d’état de l’Université de Montpellier II, (USTL), Avril 1992.Google Scholar
  10. [9]
    J. Daniels, “Objects Design Methods and Tools”, IEEE London, UK, 1994.Google Scholar
  11. [10]
    D. An Chiang, Ming-Chi Lee, “Cyclic Inheritance Detection for Object-Oriented Database”, IEEE New York, NY, USA, Vol 2 1047 pp., 1992, Univ. TAIWAM.Google Scholar
  12. [11]
    Chi-Ming Chung; Lee M. C, “Inheritance-Based Object-Oriented Software Metrics”, IEEE New York, NY, USA, 1992 Vol 2 1047 pp.Google Scholar
  13. [12]
    Chi-Ming Chung; Chun-Chi Wang, Lee M. C, ‘Class Hierarchy Based Metric for Object-Oriented Design», IEEE New York, NY, USA, 1994 Vol 2 xxvii+1111 pp.Google Scholar
  14. [13]
    M. M Gammoudi. ‘Méthode de décomposition rectangulaire d’une relation binaire: une base formelle et uniforme pour le génération automatique des thesaurus et la recherche documentaire. Thèse de Doctorat, Université de Nice Sofia Antipolis, Septembre 1993.Google Scholar
  15. [14]
    M.M. Gammoudi. S. Labidi “An Automatic Generation of Consensual Rules Between Experts Using Rectangular Decomposition of a Binary relation”. In Proceeding of the XI Brazilian Symposium on Artificial Intelligence, Fortaleza, October 1994.Google Scholar
  16. [15]
    M.M. Gammoudi “Heuristics for Clustering Method and its use in Information Retrieval System”, in Proceeding of the International Conference SCCC’96, Valdivia, Chile, November 1996.Google Scholar
  17. [16]
    M. M. Gammoudi, J. D. Mendes, W. S. Pinto “Inheritance Graph Hierarchy Construction using Rectangular Decomposition of a Binary Relation and designer feedback” in Proceedings of the International Conference on Conceptual Modeling ER’97. Los Angeles — November 1997.Google Scholar
  18. [17]
    B. Ganter, “Two Basic Algorithms in Concept Analysis”, Preprint 831, Technische Hochschule Darmstad, p. 28, 1984.Google Scholar
  19. [18]
    M. R. Garay, D. S. Jonhson, “Computer and Interactability: A guide of the theory of NP-Completeness.”, W. H. Freeman, 1979.Google Scholar
  20. [19]
    R. Godin, R. Missaoui, H. Alaoui, “Learning Algorithms Using a Galois Lattice Structure“, in Proceedings of the 1991 IEEE Int. Conf. On Tools for AI, San Jose CA Nov, 1991Google Scholar
  21. [20]
    R. Godin and H. Mili, “Building and Maintaining analysis-level class hierarchies using Galois Lattice”, OOPSLA-93, Washington DC, USA, ACM press pp. 394–410, October 1993.Google Scholar
  22. [21]
    R. Godin and H. Mili, “Conceptual Clustering Methods based on Galois lattice and aplications”, French Review on Artificial Intelligence, Vol 9 N 2, 1995 pp. 105–137.Google Scholar
  23. [22]
    A. Guenoche, «Construction du treillis de Galois d’une relation binaire», Math. Inf. Sci. hum., 28ème année, (109): 41–53, 1990.zbMATHMathSciNetGoogle Scholar
  24. [23]
    J. Mayrand, G. François, M. Ettore. “Inheritance Graph Assessment Using Metrics”, Proceedings of METRICS’ 96, 1996 IEEE.Google Scholar
  25. [24]
    E.M. Norris, “An algorithm for Computing the Maximal Rectangles in a Binary Relation”, Revue Roumaine de Mathématiques Pures et Appliquées, 23(2) p. 243–250, 1978.zbMATHMathSciNetGoogle Scholar
  26. [25]
    R. E. Stepp and R. S. Michalski, “Conceptual clustering: inventing goal-oriented classifications of structured objects”, R. Michalski, J. Carbonnel, and T. Mitchell, (eds)., Machine Learning: An I.A. Approach. San Mateo, Calif. Morgan Kauffmann, 1986.Google Scholar
  27. [26]
    I. Schmitt, G. Saake, “Integration of inheritance trees as part of view generation for database federations”, In proceeding of the 15th International Conference on Conceptual Modelling-ER’96. Cottbus, Germany, 7th – 10th October 1996.Google Scholar
  28. [27]
    W. Sun, S. Guo, F. Arafi, S. Tu “Supporting Inheritance in Relational Database”, IEEE Computing 1992.Google Scholar
  29. [28]
    R. Wille, “Finite Distributive Lattices as Concept Lattices”, Atti Inc. Logica Matematica, (2) 1985.Google Scholar
  30. [29]
    R. Wille, “Knowledge Acquisition by Methods of Formal Concept Analysis”, In E. Diday (Eds). Data Analysis, Learning Symbolic and Numeric Knowledge, NY, 1989.Google Scholar
  31. [30]
    A. Yahia, L. Lakhal, JP. Bordat, “Designing Class Hierarchies of Object Database Schema”, in Proceedings of the Computer journal, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Mohamed M. Gammoudi
    • 1
  • Ibtissem Nafkha
    • 1
  • Zair Abdelouahab
    • 2
  1. 1.Department of Computer Science, Campus UniversitaireUniversity of TunisTunisTunisia
  2. 2.Campus do BacangaUniversidade Federal do MaranhaoSão Luis —MABrasil

Personalised recommendations