当前位置: X-MOL 学术ACM SIGMOD Rec. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Technical Perspective: Structure and Complexity of Bag Consistency: ACM SIGMOD Record: Vol 51, No 1
ACM SIGMOD Record ( IF 1.1 ) Pub Date : 2022-06-01 , DOI: 10.1145/3542700.3542718
Mihalis Yannakakis

The paper Structure and Complexity of Bag Consistency by Albert Atserias and Phokion Kolaitis [1] studies fundamental structural and algorithmic questions on the global consistency of databases in the context of bag semantics. A collection D of relations is called globally consistent if there is a (so-called "universal") relation over all the attributes that appear in all the relations of D whose projections yield the relations in D. The basic algorithmic problem for consistency is: given a database D, determine whether D is globally consistent. An obvious necessary condition for global consistency is local (or pairwise) consistency: every pair of relations in D must be consistent. This condition is not sufficient however: It is possible that every pair is consistent, but there is no single global relation over all the attributes whose projections yield the relations in D. A natural structural question is: Which database schemas have the property that every locally consistent database over the schema is also globally consistent?



中文翻译:

技术视角:袋子一致性的结构和复杂性:ACM SIGMOD 记录:第 51 卷,第 1 期

Albert Atserias 和 Phokion Kolaitis [1] 的论文 Structure and Complexity of Bag Consistency [1] 研究了袋语义背景下数据库全局一致性的基本结构和算法问题。如果 D 的所有关系中出现的所有属性都存在(所谓的“通用”)关系,则关系集合 D 被称为全局一致,其投影产生 D 中的关系。一致性的基本算法问题是:给定一个数据库 D,判断 D 是否全局一致。全局一致性的一个明显必要条件是局部(或成对)一致性:D 中的每一对关系都必须是一致的。然而,这个条件是不充分的:有可能每一对都是一致的,

更新日期:2022-06-02
down
wechat
bug