类型化模板依赖关系的隐含和有限隐含问题

Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems Pub Date : 1982-03-29 DOI:10.1145/588111.588149

Moshe Y. Vardi

{"title":"类型化模板依赖关系的隐含和有限隐含问题","authors":"Moshe Y. Vardi","doi":"10.1145/588111.588149","DOIUrl":null,"url":null,"abstract":"The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.","PeriodicalId":126896,"journal":{"name":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"The implication and finite implication problems for typed template dependencies\",\"authors\":\"Moshe Y. Vardi\",\"doi\":\"10.1145/588111.588149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.\",\"PeriodicalId\":126896,\"journal\":{\"name\":\"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-03-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/588111.588149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/588111.588149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

类型化模板依赖项类是一类数据依赖项，其中包括嵌入式多值依赖项和连接依赖项。证明了该类的蕴涵问题和有限蕴涵问题是不可解的。一个直接的推论是，这个类没有有限蕴涵的形式系统。我们还展示了如何构造类型化模板依赖项的有限集合，这些依赖项的含义和有限含义问题是无法解决的。简单模板依赖关系类是上述类的适当子类，它泛化了稍微嵌入的连接依赖关系。证明了该类的蕴涵问题和有限蕴涵问题也是不可解的。一个直接的推论是，这个类既没有蕴涵也没有有限蕴涵的形式系统。

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

查看原文本刊更多论文

The implication and finite implication problems for typed template dependencies

The class of typed template dependencies is a class of data dependencies that includes embedded multivalued and join dependencies. We show that the implication and the finite implication problems for this class are unsolvable. An immediate corollary is that this class has no formal system for finite implication. We also show how to construct a finite set of typed template dependencies whose implication and finite implication problems are unsolvable.The class of simple template dependencies is a proper subclass of the above class, and it generalizes slightly embedded join dependencies. It is shown that the implication and the finite implication problems for this class are also unsolvable. An immediate corollary is that this class has no formal system for either implication or finite implication.

求助全文

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

来源期刊

Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

自引率

0.00%

发文量