Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Two-Phase Parallel Content Matching Algorithm for Publish-Subscribe Systems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Shah, Medha Abhijeet Doijad, Suhas Kulkarni, Dinesh B. |
| Copyright Year | 2017 |
| Abstract | Content-based subscriptions systems are an emerging alternative to traditional Publish-Subscribe systems because they permit more flexible subscriptions along multiple dimensions. In these systems, each subscription is a set of predicates which may test arbitrary attributes within an event. However, the matching problem for content-based systems, determining for each event the subset of all subscriptions whose predicates match the event, is still an open problem. We present efficient, scalable tree based technique as well as the parallel implementation of it, and discuss their impact. The tree-based technique improves limitation of table based approach. Also, we present optimized two phase matching algorithm. Result shows 65% reduction in matching time, and increase in throughput by 82%. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ijcsit.com/docs/Volume%208/vol8issue3/ijcsit2017080318.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
