H-Tree: An Efficient Index Structurefor Event Matching in Content-BasedPublish/Subscribe Systems
Content-based publish/subscribe systems have been employed to deal with complex distributed information flows in many applications. It is well recognized that event matching is a fundamental component of such large-scale systems. Event matching searches a space which is composed of all subscriptions...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on parallel and distributed systems 2015-06, Vol.26 (6), p.1622-1632 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!