Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient filtering in publish-subscribe systems using binary decision diagrams
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Algorithms and Theory of Computation Handbook
Algorithms and Theory of Computation Handbook
Publish/Subscribe on the Web at Extreme Speed
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
G-ToPSS: fast filtering of graph-based metadata
WWW '05 Proceedings of the 14th international conference on World Wide Web
Metadata inference for document retrieval in a distributed repository
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Towards expressive publish/subscribe systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Fast user notification in large-scale digital libraries: experiments and results
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
| Hi-index | 0.00 |
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 document descriptions, all rely on a taxonomy that is a hierarchically organized set of keywords, or terms. The digital library supports insertion, update and removal 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 description. The paper addresses the problem of efficiently supporting the notification process, and makes contributions in two directions: (a) definition of a formal model for the publish/subscribe process; (b) proposal of a semi-lattice structure for subscriptions allowing the filtering out of non matching subscriptions. Experimental results that show the cost benefits obtained by our approach are presented in the full paper [6]