首页> 外文会议>International conference on relational methods in computer science >A Completeness Theorem for Extended Order Dependencies on Relational Attributed Models in Dedekind Categories
【24h】

A Completeness Theorem for Extended Order Dependencies on Relational Attributed Models in Dedekind Categories

机译:用于扩展订单依赖性的完整性定理在Dedekind类别中的关系归属模型

获取原文

摘要

Order dependencies in relational database due to Ginsburg and Hull are relationships between attributes with domains of ordered values. The basic notions in this paper are comparison systems and relational attribute models in Dedekind categories. A comparison system constitutes a formal structure of possible orders for attribute domains. A relational attribute model is a system of relations on an object (of tuples or records) in Dedekind categories, which can be constructed by a suitable relational interpretation of comparing symbols. Generalizing order dependencies as well as functional dependencies, the paper introduces extended order dependencies, and their satisfactory relations for relational attribute models in Dedekind category. Then we give a simple proof that a revised set of inference rules is sound and complete.
机译:由于GINSBURG和HULL引起的关系数据库中的顺序依赖性是有序值域之间的属性之间的关系。本文的基本概念是Dedekind类别中的比较系统和关系属性模型。比较系统构成属性域可能订单的正式结构。关系属性模型是Dedekind类别中的对象(元组或记录)的关系系统,其可以通过对比较符号的合适关系解释来构造。概括顺序依赖关系以及功能依赖项,介绍了Dedekind类别中的扩展订单依赖项,以及它们对关系属性模型的令人满意的关系。然后我们给出了一个简单的证据,即修订的推理规则集是完整的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号