Abstract | ||
---|---|---|
Publish/subscribe is a promising paradigm with a growing appeal in building large-scale distributed applications. Existing publish/subscribe systems have limited support for semantic information. In this paper, we propose JTangPS (JTang Publish/subscribe System), an RDF (Resource Description Framework) based publish/subscribe system which uses RDF graphs to describe events and RDF graph patterns to represent subscriptions. A fast graph-based matching algorithm is presented to reconcile the conflict of expressiveness and scalability. Experimental results using synthetic workload demonstrate the scalability of system with large numbers of subscriptions. |
Year | DOI | Venue |
---|---|---|
2007 | 10.1109/SKG.2007.197 | SKG |
Keywords | Field | DocType |
limited support,promising paradigm,jtang publish,fast graph-based matching algorithm,subscribe system,rdf graph pattern,large number,rdf-based publish,resource description framework,rdf graph,semantic information,graph theory,distributed application,publish subscribe,distributed processing | Graph theory,Publication,Graph,World Wide Web,Computer science,Semantic information,RDF,Blossom algorithm,Expressivity,Scalability,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-3007-9 | 1 | 0.35 |
References | Authors | |
0 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dongcai Shi | 1 | 27 | 3.99 |
Jianwei Yin | 2 | 805 | 89.86 |
Yiyuan Li | 3 | 7 | 2.13 |
Jianfeng Qian | 4 | 17 | 2.28 |
Jinxiang Dong | 5 | 311 | 65.36 |