作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (13): 58-60. doi: 10.3969/j.issn.1000-3428.2009.13.020

• 软件技术与数据库 • 上一篇    下一篇

基于XSLT模板展开的对等模式映射合成

赵智超1,赵 政2   

  1. (1. 中国电子科学研究院,北京 100041;2. 天津大学计算机科学与技术学院,天津 300072)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-05 发布日期:2009-07-05

Peer-to-Peer Schema Mapping Composition Based on XSLT Template Unfolding

ZHAO Zhi-chao1, ZHAO Zheng2   

  1. (1. China Academy of Electronics and Information Technology, Beijing 100041; 2. School of Computer Science and Technology, Tinajin University, Tianjin 300072)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-05 Published:2009-07-05

摘要: 针对对等数据管理系统中绕过离开节点时多次重写的耗时问题,提出一种基于XSLT模板展开的对等模式映射合成方法。处理模板匹配风格的XSLT子集表示的2个映射,通过按序对模板内容再次匹配展开,形成等价于多个映射的合成映射。当映射路径上的相邻节点一起离开时,代理节点使用合成映射直接绕过。仿真结果表明,合成方法能够正确生成等效映射,绕过时间缩短,网络拓扑更加强健。

关键词: 映射合成, 对等计算, 数据共享

Abstract: Aiming at the time-consuming problem of multiple reformulations when bypassing left peers in peer data management system, a peer schema mapping composition method is proposed based on XSLT template unfolding. By matching and unfolding template contents consecutively, the method processes two mappings expressed in an XSLT subset with the style of matching templates, and forms a composed mapping equivalent to multiple mappings. When neighboring peers on mapping path depart together, agent peer no longer reformulates multiple times, but uses composed peer to bypass directly. Simulation results show that the composition method can produce equivalent mappings correctly. By passing time shortens significantly and network topology becomes robust.

Key words: mapping composition, Peer-to-Peer computing, data sharing

中图分类号: