{"title":"Knowledge discovery in relational database: extraction of n-ary relationships","authors":"C. Soutou","doi":"10.1109/BIWIT.1997.614050","DOIUrl":null,"url":null,"abstract":"Presents an automatic process for extracting the n-ary relationships from an operating relational database. This database reverse engineering process performs (i) the extraction of n-ary relationship tables, and (ii) the deduction of cardinalities. The first step is based on querying a view of the data dictionary and some working tables. The second step is based on the automatic generation of a set of SQL queries for each n-ary relationship table. We focus on the realistic assumptions that there are no constraints on the uniqueness of the attribute names, and dependencies are not supposed to be known a priori. A PRO*C program has been implemented; it enables us to automatically build SQL queries via dynamic SQL. We also study the influence of the number of key attributes and the number of records upon the performance of our process.","PeriodicalId":166034,"journal":{"name":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","volume":"540 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Third Basque International Workshop on Information Technology - BIWIT'97 - Data Management Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIWIT.1997.614050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Presents an automatic process for extracting the n-ary relationships from an operating relational database. This database reverse engineering process performs (i) the extraction of n-ary relationship tables, and (ii) the deduction of cardinalities. The first step is based on querying a view of the data dictionary and some working tables. The second step is based on the automatic generation of a set of SQL queries for each n-ary relationship table. We focus on the realistic assumptions that there are no constraints on the uniqueness of the attribute names, and dependencies are not supposed to be known a priori. A PRO*C program has been implemented; it enables us to automatically build SQL queries via dynamic SQL. We also study the influence of the number of key attributes and the number of records upon the performance of our process.