This paper describes a reverse engineering method which particularly deals with the elicitation of inheritance links embedded in a relational database, combining heuristic and algorithmic approaches. We provide rules for detecting intersection constraints and inclusion dependencies. Heuristics are proposed for understanding null value semantics. Finally, we present decision rules for detecting existence dependencies and translating them into IS-A hierarchies among entities. An example is used to illustrate our approach.
LAMMARI, N., COMYN-WATTIAU, I. and AKOKA, J. (2007). Extracting Generalization Hierarchies from Relational Databases - A Reverse Engineering Approach. Data and Knowledge Engineering, pp. 568-589.