efficient event matching in publish/subscribe: based on routing     destination and matching history

	efficient event matching in publish/subscribe: based on routing destination and matching history
	Guo Xiangfeng; Wei Jun; Han Dongli
	2008
会议名称	IEEE International Conference on Networking, Architecture, and Storage
会议录名称	Proceedings of the 2008 IEEE International Conference on Networking, Architecture, and Storage - IEEE NAS 2008
页码	129-136
会议日期	JUN 12-14,
会议地点	Chongqing, PEOPLES R CHINA
出版地	10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA
出版者	PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE
ISBN	978-0-7695-3187-8
部门归属	Guo, Xiangfeng; Wei, Jun Chinese Acad Sci, Inst Software, Beijing 100864, Peoples R China.
摘要	Efficient event matching in a content-based publish/subscribe system is an important problem. Most existing matching solutions focus on subscription relations, such as cover and merge. We observe that event matching can leverage matching histo
关键词	Publish/subscribe Event Matching Performance Optimization
主办者	IEEE Tech Comm Parallel Proc, IEEE Tech Comm Distributed Proc, IEEE Comp Soc, IEEE, Chongqing Univ, HuaZhong Univ Sci & Technol
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/10604
专题	软件工程技术研究开发中心
推荐引用方式 GB/T 7714	Guo Xiangfeng,Wei Jun,Han Dongli. efficient event matching in publish/subscribe: based on routing destination and matching history[C]. 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1264 USA:PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE,2008:129-136.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
04579570.pdf（365KB）			开放获取	--	请求全文