论强可能功能依赖的公理化

Munqath Alattar, A. Sali
{"title":"论强可能功能依赖的公理化","authors":"Munqath Alattar, A. Sali","doi":"10.1142/s2196888821500056","DOIUrl":null,"url":null,"abstract":"In general, there are two main approaches to handle the missing data values problem in SQL tables. One is to ignore or remove any record with some missing data values. The other approach is to fill or impute the missing data with new values [A. Farhangfar, L. A. Kurgan and W. Pedrycz, A novel framework for imputation of missing values in databases, IEEE Trans. Syst. Man Cybern. A, Syst. Hum. 37(5) (2007) 692–709]. In this paper, the second method is considered. Possible worlds, possible and certain keys, and weak and strong functional dependencies were introduced in Refs. 4 and 2 [H. Köhler, U. Leck, S. Link and X. Zhou, Possible and certain keys for SQL, VLDB J. 25(4) (2016) 571–596; M. Levene and G. Loizou, Axiomatisation of functional dependencies in incomplete relations, Theor. Comput. Sci. 206(1) (1998) 283–300]. We introduced the intermediate concept of strongly possible worlds in a preceding paper, which are obtained by filling missing data values with values already existing in the table. Using strongly possible worlds, strongly possible keys and strongly possible functional dependencies (spFDs) were introduced in Refs. 5 and 1 [M. Alattar and A. Sali, Keys in relational databases with nulls and bounded domains, in ADBIS 2019: Advances in Databases and Information Systems, Lecture Notes in Computer Science, Vol. 11695 (Springer, Cham, 2019), pp. 33–50; Functional dependencies in incomplete databases with limited domains, in FoiKS 2020: Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, Vol. 12012 (Springer, Cham, 2020), pp. 1–21]. In this paper, some axioms and rules for strongly possible functional dependencies are provided, These axioms and rules form the basis for a possible axiomatization of spFDs. For that, we analyze which weak/strong functional dependency and certain functional dependency axioms remain sound for strongly possible functional dependencies, and for the axioms that are not sound, we give appropriate modifications for soundness.","PeriodicalId":256649,"journal":{"name":"Vietnam. J. Comput. Sci.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Toward an Axiomatization of Strongly Possible Functional Dependencies\",\"authors\":\"Munqath Alattar, A. Sali\",\"doi\":\"10.1142/s2196888821500056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In general, there are two main approaches to handle the missing data values problem in SQL tables. One is to ignore or remove any record with some missing data values. The other approach is to fill or impute the missing data with new values [A. Farhangfar, L. A. Kurgan and W. Pedrycz, A novel framework for imputation of missing values in databases, IEEE Trans. Syst. Man Cybern. A, Syst. Hum. 37(5) (2007) 692–709]. In this paper, the second method is considered. Possible worlds, possible and certain keys, and weak and strong functional dependencies were introduced in Refs. 4 and 2 [H. Köhler, U. Leck, S. Link and X. Zhou, Possible and certain keys for SQL, VLDB J. 25(4) (2016) 571–596; M. Levene and G. Loizou, Axiomatisation of functional dependencies in incomplete relations, Theor. Comput. Sci. 206(1) (1998) 283–300]. We introduced the intermediate concept of strongly possible worlds in a preceding paper, which are obtained by filling missing data values with values already existing in the table. Using strongly possible worlds, strongly possible keys and strongly possible functional dependencies (spFDs) were introduced in Refs. 5 and 1 [M. Alattar and A. Sali, Keys in relational databases with nulls and bounded domains, in ADBIS 2019: Advances in Databases and Information Systems, Lecture Notes in Computer Science, Vol. 11695 (Springer, Cham, 2019), pp. 33–50; Functional dependencies in incomplete databases with limited domains, in FoiKS 2020: Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, Vol. 12012 (Springer, Cham, 2020), pp. 1–21]. In this paper, some axioms and rules for strongly possible functional dependencies are provided, These axioms and rules form the basis for a possible axiomatization of spFDs. For that, we analyze which weak/strong functional dependency and certain functional dependency axioms remain sound for strongly possible functional dependencies, and for the axioms that are not sound, we give appropriate modifications for soundness.\",\"PeriodicalId\":256649,\"journal\":{\"name\":\"Vietnam. J. Comput. Sci.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Vietnam. J. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s2196888821500056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vietnam. J. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s2196888821500056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通常,有两种主要方法来处理SQL表中丢失数据值的问题。一种方法是忽略或删除任何缺少数据值的记录。另一种方法是用新值填充或输入缺失的数据[A]。法汉法,L. A. Kurgan和W. Pedrycz,数据库缺失值估算的新框架,IEEE翻译。系统。男人Cybern。一个系统。哼,37(5)(2007)692-709]。本文考虑的是第二种方法。参考文献4和2中介绍了可能世界、可能键和特定键以及弱和强函数依赖[H]。[2] [0] [0] [0] [0] [0] [0] [0];Levene和G. Loizou,不完备关系中功能依赖的公理化,理论。第一版。科学通报,2006(1)(1998):283-300。我们在前一篇文章中引入了强可能世界的中间概念,它是通过用表中已经存在的值填充缺失的数据值而得到的。利用强可能世界,在文献5和文献1中引入了强可能键和强可能函数依赖(spfd)。Alattar和A. Sali,具有null和有界域的关系数据库中的关键字,ADBIS 2019:数据库和信息系统的进展,计算机科学讲义,第11695卷(Springer, Cham, 2019),第33-50页;有限域不完全数据库中的功能依赖关系,《FoiKS 2020:信息与知识系统的基础》,《计算机科学讲义》,2012年第1卷(Springer, Cham, 2020), pp. 1-21]。本文给出了强可能函数依赖的一些公理和规则,这些公理和规则构成了函数函数依赖的可能公理化的基础。为此,我们分析了哪些弱/强函数依赖和某些函数依赖公理对于强可能的函数依赖仍然是可靠的,对于不可靠的公理,我们给出了适当的完善。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Toward an Axiomatization of Strongly Possible Functional Dependencies
In general, there are two main approaches to handle the missing data values problem in SQL tables. One is to ignore or remove any record with some missing data values. The other approach is to fill or impute the missing data with new values [A. Farhangfar, L. A. Kurgan and W. Pedrycz, A novel framework for imputation of missing values in databases, IEEE Trans. Syst. Man Cybern. A, Syst. Hum. 37(5) (2007) 692–709]. In this paper, the second method is considered. Possible worlds, possible and certain keys, and weak and strong functional dependencies were introduced in Refs. 4 and 2 [H. Köhler, U. Leck, S. Link and X. Zhou, Possible and certain keys for SQL, VLDB J. 25(4) (2016) 571–596; M. Levene and G. Loizou, Axiomatisation of functional dependencies in incomplete relations, Theor. Comput. Sci. 206(1) (1998) 283–300]. We introduced the intermediate concept of strongly possible worlds in a preceding paper, which are obtained by filling missing data values with values already existing in the table. Using strongly possible worlds, strongly possible keys and strongly possible functional dependencies (spFDs) were introduced in Refs. 5 and 1 [M. Alattar and A. Sali, Keys in relational databases with nulls and bounded domains, in ADBIS 2019: Advances in Databases and Information Systems, Lecture Notes in Computer Science, Vol. 11695 (Springer, Cham, 2019), pp. 33–50; Functional dependencies in incomplete databases with limited domains, in FoiKS 2020: Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, Vol. 12012 (Springer, Cham, 2020), pp. 1–21]. In this paper, some axioms and rules for strongly possible functional dependencies are provided, These axioms and rules form the basis for a possible axiomatization of spFDs. For that, we analyze which weak/strong functional dependency and certain functional dependency axioms remain sound for strongly possible functional dependencies, and for the axioms that are not sound, we give appropriate modifications for soundness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improving Arabic Sentiment Analysis Using LSTM Based on Word Embedding Models Synthetic Data Generation for Morphological Analyses of Histopathology Images with Deep Learning Models Generating Popularity-Aware Reciprocal Recommendations Using Siamese Bi-Directional Gated Recurrent Units Network Hyperparameter Optimization of a Parallelized LSTM for Time Series Prediction Natural Language Processing and Sentiment Analysis on Bangla Social Media Comments on Russia-Ukraine War Using Transformers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1