Name
Abstract | ||
|---|---|---|
Publish/subscribe has been successfully used in a variety of information dissemination applications. However, in a cloud computing environment, the enormous amount of information results in a very high requirement for the computing performance of a publish/subscribe method. In this paper, we propose an efficient index called Enindex for publish/subscribe matching. First, we group all the subscriptions submitted by subscribers, based on the key attributes (i.e., the most frequent attributes occurring in the subscriptions). Second, we group all the predicates contained in the subscriptions, according to three basic operators: ź (greater),=(equal), and ź (less), so as to remove the repeated predicates, and thus reduce the memory overhead. Finally, we propose an effective index structure to combine the grouped subscriptions together with the grouped predicates. Enindex not only has a small memory overhead, but also can support efficient publish/subscribe matching and online subscription updating. We conduct extensive experiments on synthetic datasets, and the experimental results demonstrate the superiority of the Enindex over state-of-the-art methods in terms of memory overhead and computing efficiency. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.knosys.2016.07.017 | Knowl.-Based Syst. |
Keywords | Field | DocType |
Publish/subscribe,Matching,Predicate,Index | Publication,Data mining,Computer science,Operator (computer programming),Information Dissemination,Database,Cloud computing | Journal |
Volume | Issue | ISSN |
110 | C | 0950-7051 |
Citations | PageRank | References |
0 | 0.34 | 26 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zongmin Cui | 1 | 61 | 9.89 |
| Zongda Wu | 2 | 251 | 16.20 |
| Caixue Zhou | 3 | 16 | 2.39 |
| Guangyong Gao | 4 | 37 | 4.71 |
| Jing Yu | 5 | 0 | 0.34 |
| Zhiqiang Zhao | 6 | 0 | 0.34 |
| Bin Wu | 7 | 4 | 2.08 |