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
Approximating the minimum degree spanning tree to within one from the optimal degree
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
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
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Publish/Subscribe on the Web at Extreme Speed
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Matching for Web-Based Publish/Subscribe Systems
CooplS '02 Proceedings of the 7th International Conference on Cooperative Information Systems
On labeling schemes for the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Subject space: a state-persistent model for publish/subscribe systems
CASCON '02 Proceedings of the 2002 conference of the Centre for Advanced Studies on Collaborative research
Efficient matching for state-persistent publish/subscribe systems
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Filtering algorithms for information retrieval models with named attributes and proximity operators
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
An ontology-based publish/subscribe system
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Predicate-based Filtering of XPath Expressions
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
User notification in taxonomy based digital libraries
SIGDOC '06 Proceedings of the 24th annual ACM international conference on Design of communication
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
| Hi-index | 0.00 |
We are interested in evaluating the performance of new matching algorithms for user notification in digital libraries (DL). We consider a subscription system which continuously evaluates queries over a large repository containing document descriptions. The subscriptions and the document descriptions rely on a taxonomy that is a hierarchically organized set of 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 proposes a notification algorithm dedicated to taxonomy-based DLs, addresses computational issues and report a full set of experiments illustrating the advantages of the approach.