首页> 外文会议>International Conference on Theoretical and Mathematical Foundations of Computer Science >Coalgebraic Specification of Query Computation in Intensional P2P Database Systems
【24h】

Coalgebraic Specification of Query Computation in Intensional P2P Database Systems

机译:海峡P2P数据库系统中查询计算的临时规范

获取原文

摘要

The notion of ontology has become widespread in fields such as intelligent information integration, information retrieval, electronic commerce and semantic Web. We consider the incomplete nature of the information in Web, so that each ontology of a peer is a logic theory of a database with a more than one minimal Herbrand model. Because of that the contributions to the query answer of any peer are given by the known answers only (which are true in all models of a peer-database) that such peer provides. The semantics of view-based mappings between peer ontologies has to be based only on known answers from peers, so that these mappings, in a Gabbay-style rules, need a Hybrid modal logic language or, alternatively, multi-modal logic, to be correctly specified. We show that the query answers for local peer databases are computed according to the epistemic modal S5 logic, where frames are partitioned according to the structure of peers. But also the global P2P query answering is based on a modal logic and we define it formally. Finally, we present coalgebraic semantics for such P2P database systems, and for a grid-computing query processing system.
机译:本体论的观念已成为广泛领域,如智能信息集成,信息检索,电子商务和语义Web。我们认为,在Web的信息不完整的性质,让同行的每个本体是一个数据库,用一个以上的最小Herbrand模型中的逻辑理论。正因为如此,以任何对等的查询答案的贡献仅由已知的答案(这是在对数据库的所有型号如此),这样的同行提供给。基于视图的对等体的本体之间的映射的语义必须被从对等体已知答案仅为主,使这些映射,在Gabbay-样式规则,需要一个混合模态逻辑语言,或者,多模式的逻辑,以正确指定。我们表明,本地对数据库的查询答案是根据认知模式S5的逻辑,其中帧根据同行的结构分割计算。但也是全球P2P查询应答是基于模态逻辑和我们正式定义它。最后,我们提出这样的P2P数据库系统coalgebraic语义,和用于网格计算查询处理系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号