Self-Correlation and Maximum Independence in Finite Relations

D. Gurov, Minko Markov
{"title":"Self-Correlation and Maximum Independence in Finite Relations","authors":"D. Gurov, Minko Markov","doi":"10.4204/EPTCS.191.7","DOIUrl":null,"url":null,"abstract":"We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition X of S such that the join of the projections of R over the elements of X yields R. Identifying independent partitions has many applications and corresponds conceptually to revealing orthogonality between sets of dimensions in multidimensional point spaces. A subset of S is termed self-correlated if there is a value of each of its attributes such that no tuple of R contains all those values. This paper uncovers a connection between independence and self-correlation, showing that the maximum independent partition is the least fixed point of a certain inflationary transformer α that operates on the finite lattice of partitions of S. α is defined via the minimal self-correlated subsets of S. We us e some additional properties of α to show the said fixed point is still the limit of the standard a pproximation sequence, just as in Kleene’s well-known fixed point theorem for continuous func tions.","PeriodicalId":119563,"journal":{"name":"Fixed Points in Computer Science","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fixed Points in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.191.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider relations with no order on their attributes as in Database Theory. An independent partition of the set of attributes S of a finite relation R is any partition X of S such that the join of the projections of R over the elements of X yields R. Identifying independent partitions has many applications and corresponds conceptually to revealing orthogonality between sets of dimensions in multidimensional point spaces. A subset of S is termed self-correlated if there is a value of each of its attributes such that no tuple of R contains all those values. This paper uncovers a connection between independence and self-correlation, showing that the maximum independent partition is the least fixed point of a certain inflationary transformer α that operates on the finite lattice of partitions of S. α is defined via the minimal self-correlated subsets of S. We us e some additional properties of α to show the said fixed point is still the limit of the standard a pproximation sequence, just as in Kleene’s well-known fixed point theorem for continuous func tions.
有限关系中的自相关和最大独立性
在数据库理论中,我们考虑属性上没有顺序的关系。有限关系R的属性集S的独立划分是S的任意划分X,使得R的投影在X的元素上的连接产生R。识别独立划分有许多应用,在概念上对应于揭示多维点空间中维集之间的正交性。如果S的一个子集的每个属性都有一个值,使得R的元组不包含所有这些值,则称为自相关子集。本文揭示了独立性与自相关之间的联系,证明了最大独立分割是作用于s的分割有限格上的某膨胀变压器α的最小不动点。α是通过s的最小自相关子集来定义的。我们利用α的一些附加性质来证明该不动点仍然是标准a逼近序列的极限。就像Kleene著名的连续函数不动点定理一样。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信