Skip to Main content Skip to Navigation
Conference papers

Relational database reverse engineering : elicitation of generalization hierarchies

Abstract : This paper describes a method aiming at the extraction of generalization/specialization hierarchies contained in a relational database. This reverse engineering approach takes advantage of two major characteristics: first, we use DDL and DML specifications as well as data in a combined way, secondly, we provide not only generalization/specialization hierarchies but also integrity constraints allowing us to elicit the generalization/specialization links hidden in the structures and instances of the database. The result of the process consists of an enriched conceptual representation of the relational database. This approach is mainly based on heuristics. The heuristic rules map a relational meta-model onto a conceptual one. They are divided into three categories: semantics suspicion rules, reinforcement rules and confirmation rules. We illustrate our approach using a fairly complex example. Some extensions are discussed.
Document type :
Conference papers
Complete list of metadata
Contributor : Laboratoire Cedric <>
Submitted on : Friday, March 6, 2015 - 10:49:57 AM
Last modification on : Wednesday, June 24, 2020 - 4:18:33 PM

Links full text



Jacky Akoka, Isabelle Comyn-Wattiau, Nadira Lammari. Relational database reverse engineering : elicitation of generalization hierarchies. ER’ 99 Workshops on Evolution and Change in Data Management, Reverse Engineering in Information Systems, and the World Wide Web and Conceptual Modeling, Nov 1999, Paris, France. pp.173-185, ⟨10.1007/3-540-48054-4_15⟩. ⟨hal-01124843⟩



Record views