Name
Abstract | ||
|---|---|---|
We consider a publish/subscribe system for digital libraries which continuously evaluates queries over a large repository containing document descriptions. The subscriptions, the query expressions and the doc- ument descriptions, all rely on a taxonomy that is a hierarchically organized set of keywords, or terms. The digital library supports insertion, update and re- moval of a document. Each of these operations is seen as an event that must be notified only to those users whose subscriptions match the document's descrip- tion. The paper addresses the problem of eciently supporting the notification process, and makes contri- butions in three directions: (a) definition of a formal model for the publish/subscribe process; (b) intro- duction of a semi-lattice structure on subscriptions allowing the filtering out of non matching subscrip- tions; (c) experimental results that show the cost ben- efits obtained by our approach. |
Year | Venue | Keywords |
|---|---|---|
2006 | BDA | digital library,publish subscribe |
Field | DocType | Citations |
Publication,World Wide Web,Information retrieval,Expression (mathematics),Computer science,Digital library | Conference | 1 |
PageRank | References | Authors |
0.37 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hanen Belhaj Frej | 1 | 1 | 1.04 |
| Philippe Rigaux | 2 | 444 | 110.71 |
| Nicolas Spyratos | 3 | 736 | 233.07 |