发布/订阅驱动匹配算法

Min Song, Zhe Zhang, Guisheng Yin, Hongbin Wang, J. Ni
{"title":"发布/订阅驱动匹配算法","authors":"Min Song, Zhe Zhang, Guisheng Yin, Hongbin Wang, J. Ni","doi":"10.1109/ICICSE.2009.49","DOIUrl":null,"url":null,"abstract":"The characteristics of publish/subscribe technology are of asynchronism and loosely coupled. This phenomenon makes producers and consumers are de-communicated in temporal and spatial domains during processing. It requires develop a dynamic integration in today’s large-scale, distributed information system. This paper introduces a Semantic Integration Data Model (SIDM) for publish/subscribe systems, within which model subscription module is designed. The model contains a matching algorithm which combines both publishing-driven and subscription-driven matching algorithms. Our experiments show that this matching algorithm has high efficiency for matching.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Publish/Subscribe Driven Matching Algorithm\",\"authors\":\"Min Song, Zhe Zhang, Guisheng Yin, Hongbin Wang, J. Ni\",\"doi\":\"10.1109/ICICSE.2009.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The characteristics of publish/subscribe technology are of asynchronism and loosely coupled. This phenomenon makes producers and consumers are de-communicated in temporal and spatial domains during processing. It requires develop a dynamic integration in today’s large-scale, distributed information system. This paper introduces a Semantic Integration Data Model (SIDM) for publish/subscribe systems, within which model subscription module is designed. The model contains a matching algorithm which combines both publishing-driven and subscription-driven matching algorithms. Our experiments show that this matching algorithm has high efficiency for matching.\",\"PeriodicalId\":193621,\"journal\":{\"name\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2009.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Internet Computing for Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2009.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

发布/订阅技术的特点是异步和松耦合。这一现象使得生产者和消费者在加工过程中在时间和空间上失去了联系。它要求在当今大规模、分布式的信息系统中发展动态集成。本文介绍了面向发布/订阅系统的语义集成数据模型(SIDM),并在该模型中设计了订阅模块。该模型包含一个匹配算法,该算法结合了发布驱动和订阅驱动的匹配算法。实验表明,该匹配算法具有较高的匹配效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Publish/Subscribe Driven Matching Algorithm
The characteristics of publish/subscribe technology are of asynchronism and loosely coupled. This phenomenon makes producers and consumers are de-communicated in temporal and spatial domains during processing. It requires develop a dynamic integration in today’s large-scale, distributed information system. This paper introduces a Semantic Integration Data Model (SIDM) for publish/subscribe systems, within which model subscription module is designed. The model contains a matching algorithm which combines both publishing-driven and subscription-driven matching algorithms. Our experiments show that this matching algorithm has high efficiency for matching.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书