arrow
返回

A new normal form for nested relations

delete1987-03-01
delete0
delete
OA
AI
DOI:10.1145/12047.13676delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
We consider nested relations whose schemes are structured as trees, called scheme trees, and introduce a normal form for such relations, called the nested normal form. Given a set of attributes U , and a set of multivalued dependencies (MVDs) M over these attributes, we present an algorithm to obtain a nested normal form decomposition of U with respect to M . Such a decomposition has several desirable properties, such as explicitly representing a set of full and embedded MVDs implied by M , and being a faithful and nonredundant representation of U . Moreover, if the given set of MVDs is conflict-free, then the nested normal form decomposition is also dependency-preserving. Finally, we show that if M is conflict-free, then the set of root-to-leaf paths of scheme trees in nested normal form decomposition is precisely the unique 4NF decomposition [9, 16] of U with respect to M .
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

暂无期刊信息

机构

暂无机构信息
引用论文

引用论文

暂无论文信息