中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
Predicate Index Matching Algorithm Based on History Experience
Author: Wu, Yu-bin ; Wang, Hai-bo
Conference Name: International Conference on Computer Science and Artificial Intelligence (ICCSAI)
Conference Date: NOV 16-17, 2013
Issued Date: 2013
Conference Place: Chengdu, PEOPLES R CHINA
Keyword: history experience ; predicate index ; Publish/Subscribe ; simulated data
Publish Place: DESTECH PUBLICATIONS, INC
Indexed Type: CPCI
ISBN: 978-1-60595-132-4
Department: [Wu, Yu-bin] Univ Chinese Acad Sci, Inst Software, Chinese Acad Sci, Sci & Technol Integrated Informat Syst Lab, Beijing, Peoples R China.
Abstract: Considering the situation that the large distributed interactive simulation system which based on the Publish/Subscribe model has considerable data, improving the matching efficiency is a very important method to solve this problem. Based on the study and comparison of current matching algorithm, a predicate index matching algorithm based on history experience was proposed. Comparative experiments show that this algorithm outweighs on the matching performance as the data scale expands, when compared with naive algorithm and predicate index algorithm. When the number of subscriptions is 5000 and that of events is 10000, the algorithm reduces the amount of time by 62.07 percent and 21.64 percent, when compared respectively with naive algorithm and predicate index algorithm.
English Abstract: Considering the situation that the large distributed interactive simulation system which based on the Publish/Subscribe model has considerable data, improving the matching efficiency is a very important method to solve this problem. Based on the study and comparison of current matching algorithm, a predicate index matching algorithm based on history experience was proposed. Comparative experiments show that this algorithm outweighs on the matching performance as the data scale expands, when compared with naive algorithm and predicate index algorithm. When the number of subscriptions is 5000 and that of events is 10000, the algorithm reduces the amount of time by 62.07 percent and 21.64 percent, when compared respectively with naive algorithm and predicate index algorithm.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/16547
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Wu, Yu-bin,Wang, Hai-bo. Predicate Index Matching Algorithm Based on History Experience[C]. 见:International Conference on Computer Science and Artificial Intelligence (ICCSAI). Chengdu, PEOPLES R CHINA. NOV 16-17, 2013.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Wu, Yu-bin]'s Articles
[Wang, Hai-bo]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Wu, Yu-bin]‘s Articles
[Wang, Hai-bo]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace