Abstract
The concept of vector subscriptions to support subscription adaptations was introduced. Novel algorithms were proposed for updating vector subscriptions in classic matching tree structures, and was presented sharing algorithms for vector subscriptions. These algorithms effectively reduce the impact of subscription changes in matching tree structures. Compared to re-subscriptions method, the algorithms significantly reduce the reaction time to subscription updates and can sustain higher throughput in the presence of high update rates.
Original language | English |
---|---|
Pages (from-to) | 101-109 |
Number of pages | 9 |
Journal | Tongxin Xuebao/Journal on Communications |
Volume | 36 |
Issue number | 10 |
DOIs | |
State | Published - 1 Oct 2015 |
Keywords
- Attribute
- Constraint
- Content-based publish/subscribe
- Vector