This paper presents an algorithmic approach for extracting Is_A inheritance hierarchies from a relational database. This approach can be integrated into a global process of reverse engineering of object-oriented or extended entity/relationship conceptual schemas. It uses the instances of the database. Its originality resides in its capability not only to derive concealed inheritances but also to retrieve existence constraints (constraints on null values) within and between relations.
CITATION STYLE
Lammari, N. (1999). An algorithm to extract Is_A inheritance hierarchies from a relational database. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1728, pp. 218–232). Springer Verlag. https://doi.org/10.1007/3-540-47866-3_15
Mendeley helps you to discover research relevant for your work.