基于属性基本关系的关系数据库方案设计:计算一种类型关系的一组属性的闭包

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON) Pub Date : 2017-09-01 DOI:10.1109/SIBIRCON.2017.8109906

Ivan Ubaleht

{"title":"基于属性基本关系的关系数据库方案设计:计算一种类型关系的一组属性的闭包","authors":"Ivan Ubaleht","doi":"10.1109/SIBIRCON.2017.8109906","DOIUrl":null,"url":null,"abstract":"In this paper we present the following concepts: “the elementary relationships of attributes”, “the type of elementary relationship of attributes”. These concepts are used for the method of design of relational database schemes. We present special case, in which an initial set of relationships consists of relationships of 1‥M:0‥1 type only. For this special case we propose: the set of inference rules, algorithm of computing of the closure of a set of attributes with respect to a set of relationships of 1‥M:0‥1 type and algorithm to test the membership in the closure of the elementary relationships of attributes for some relationship of 1‥M:0‥1 type. Furthermore, we propose a proof of the correctness of the algorithm of computing of the closure of a set of attributes with a respect to a set of relationships of 1‥M:0‥1 type.","PeriodicalId":135870,"journal":{"name":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The design of relational database schemes based on the elementary relationships of attributes: Computing of the closure of a set of attributes for one type of relationship\",\"authors\":\"Ivan Ubaleht\",\"doi\":\"10.1109/SIBIRCON.2017.8109906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present the following concepts: “the elementary relationships of attributes”, “the type of elementary relationship of attributes”. These concepts are used for the method of design of relational database schemes. We present special case, in which an initial set of relationships consists of relationships of 1‥M:0‥1 type only. For this special case we propose: the set of inference rules, algorithm of computing of the closure of a set of attributes with respect to a set of relationships of 1‥M:0‥1 type and algorithm to test the membership in the closure of the elementary relationships of attributes for some relationship of 1‥M:0‥1 type. Furthermore, we propose a proof of the correctness of the algorithm of computing of the closure of a set of attributes with a respect to a set of relationships of 1‥M:0‥1 type.\",\"PeriodicalId\":135870,\"journal\":{\"name\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBIRCON.2017.8109906\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBIRCON.2017.8109906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了“属性的基本关系”、“属性的基本关系的类型”等概念。这些概念用于关系数据库方案的设计方法。我们提出一种特殊的情况，在这种情况下，一组初始的关系只由1‥M:0‥1类型的关系组成。对于这种特殊情况，我们提出:推理规则集，计算一组属性对一组1‥M:0‥1类型的关系的闭包的算法，以及测试一些1‥M:0‥1类型的关系的属性的基本关系闭包中的隶属性的算法。此外，我们提出一个算法的正确性证明，证明计算一组属性的闭包相对于一组类型为1‥M:0‥1的关系是正确的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The design of relational database schemes based on the elementary relationships of attributes: Computing of the closure of a set of attributes for one type of relationship

In this paper we present the following concepts: “the elementary relationships of attributes”, “the type of elementary relationship of attributes”. These concepts are used for the method of design of relational database schemes. We present special case, in which an initial set of relationships consists of relationships of 1‥M:0‥1 type only. For this special case we propose: the set of inference rules, algorithm of computing of the closure of a set of attributes with respect to a set of relationships of 1‥M:0‥1 type and algorithm to test the membership in the closure of the elementary relationships of attributes for some relationship of 1‥M:0‥1 type. Furthermore, we propose a proof of the correctness of the algorithm of computing of the closure of a set of attributes with a respect to a set of relationships of 1‥M:0‥1 type.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)

自引率

0.00%

发文量