arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.01545cs.LO
收藏

P2P演绎数据库的逻辑框架

A Logic Framework for P2P Deductive Databases

Luciano Caroprese, Ester Zumpano

摘要:

本文提出了一个逻辑框架,用于建模演绎数据库之间的P2P(对等)环境中的相互作用。加入P2P系统的每个节点通过使用一组映射规则(即,一组语义对应关系到属于同一环境的一组节点)来从其邻居提供或导入数据。定义了两种不同类型的映射规则:允许导入不导致不一致的最大原子集的映射规则(称为最大映射规则)和允许导入恢复一致性所需的最小原子集的映射规则(称为最小映射规则)。隐含地,最大映射规则的使用表明,只要不出现不一致,就最好导入;而最小映射规则的使用表明,除非存在不一致,否则最好不导入。本文提出了P2P系统的三种不同的声明语义:(i)最大弱模型语义,它使用映射规则从节点的邻域中导入尽可能多的知识,而不违反局部完整性约束;(ii)最小弱模型语义,其中P2P系统可以是局部不一致的,并且由邻居提供的信息用于恢复一致性,也就是说,只集成一个正确的,但不完整的数据库的缺失部分;(iii)最大-最小弱模型语义,统一了最大弱模型语义和最小弱模型语义捕获的前两个不同的角度。这最后一个语义允许在邻居中的每个对等体的特征作为一个资源,用于丰富(集成)或修复(修复)的知识,从而定义一种集成修复策略为每个对等体。逻辑程序设计理论与实践(TPLP)

英文摘要:

This paper presents a logic framework for modeling the interaction among deductive databases in a P2P (Peer to Peer) environment. Each peer joining a P2P system provides or imports data from its neighbors by using a set of mapping rules, i.e. a set of semantic correspondences to a set of peers belonging to the same environment. Two different types of mapping rules are defined: mapping rules allowing to import a maximal set of atoms not leading to inconsistency (called maximal mapping rules) and mapping rules allowing to import a minimal set of atoms needed to restore consistency (called minimal mapping rules). Implicitly, the use of maximal mapping rules states it is preferable to import as long as no inconsistencies arise; whereas the use of minimal mapping rules states that it is preferable not to import unless a inconsistency exists. The paper presents three different declarative semantics of a P2P system: (i) the Max Weak Model Semantics, in which mapping rules are used to import as much knowledge as possible} from a peer's neighborhood without violating local integrity constraints; (ii) the Min Weak Model Semantics, in which the P2P system can be locally inconsistent and the information provided by the neighbors is used to restore consistency, that is to only integrate the missing portion of a correct, but incomplete database; (iii) the Max-Min Weak Model Semantics that unifies the previous two different perspectives captured by the Max Weak Model Semantics and Min Weak Model Semantics. This last semantics allows to characterize each peer in the neighborhood as a resource used either to enrich (integrate) or to fix (repair) the knowledge, so as to define a kind of integrate-repair strategy for each peer. Under consideration in Theory and Practice of Logic Programming (TPLP).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑