首页> 外文期刊>Annals of Mathematics and Artificial Intelligence >Erratum for: A study of homogeneity in relational databases [Annals of Mathematics and Artificial Intelligence 33(2) (2001) 379-414]
【24h】

Erratum for: A study of homogeneity in relational databases [Annals of Mathematics and Artificial Intelligence 33(2) (2001) 379-414]

机译:勘误表:关系数据库中的同质性研究[数学和人工智能年鉴33(2)(2001)379-414]

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In definition 3.5 in [3], where we define the class QCQ~k, for every k ≥ 1, we need to add a second requirement for a query to be in the class QCQ~k, namely that the answer to every query f in the class QCQ~k is always the union of complete FO~k types. Previously, we considered that property to be implied by our definition, but it turns out that it is not so. There are total computable queries which for some k ≥ 1 preserve realization of FO~k types for k-tuples, but whose evaluation on some databases defines a relation which has not complete FO~k types for k-tuples. One example of such queries is the query which defines a total order in the class of Odd Multipedes of Gurevich and Shellah. We give below the correct definition, which should replace definition 3.5 in [3].
机译:在[3]中的定义3.5中,我们定义了QCQ〜k类,对于每一个k≥1,我们需要为QCQ〜k类中的查询添加第二个要求,即每个查询的答案f在类QCQ〜k中,始终是完整的FO〜k类型的并集。以前,我们认为定义会隐含该属性,但事实并非如此。对于k≥1的总可计算查询,保留了k元组的FO〜k类型的实现,但是对某些数据库的求值定义了一个关系,该关系还没有k元组的FO〜k类型。这样的查询的一个示例是在Gurevich和Shellah的Odd Multipedes类中定义总顺序的查询。我们在下面给出正确的定义,该定义应替代[3]中的定义3.5。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号