摘要
针对对等数据管理系统中绕过离开节点时多次重写的耗时问题,提出一种基于XSLT模板展开的对等模式映射合成方法。处理模板匹配风格的XSLT子集表示的2个映射,通过按序对模板内容再次匹配展开,形成等价于多个映射的合成映射。当映射路径上的相邻节点一起离开时,代理节点使用合成映射直接绕过。仿真结果表明,合成方法能够正确生成等效映射,绕过时间缩短,网络拓扑更加强健。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第13期58-60,共3页
Computer Engineering
关键词
映射合成
对等计算
数据共享
mapping composition
Peer-to-Peer computing
data sharing