ACM SIGIR Forum
An efficient representation for sparse sets
ACM Letters on Programming Languages and Systems (LOPLAS)
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Understanding and Using Context
Personal and Ubiquitous Computing
Query Merging: Improving Query Subscription Processing in a Multicast Environment
IEEE Transactions on Knowledge and Data Engineering
Mobile Push: Delivering Content to Mobile Users
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Querying and Updating a Context-Aware Service Directory in Mobile Environments
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Tree pattern aggregation for scalable XML data dissemination
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Containment of conjunctive queries with arithmetic expressions
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Bloom filter based routing for content-based publish/subscribe
Proceedings of the second international conference on Distributed event-based systems
MICS: an efficient content space representation model for publish/subscribe systems
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Soft state in publish/subscribe
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
| Hi-index | 0.00 |
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We present a novel data structure for the maintenance and matching of partial orders using chained forests. The partial order derives from the subsumption, or covering, relation inherent in the objects that are matched, typically data profiles and queries. Experimental results indicate that the structure has favourable characteristics compared with a poset-based matcher; however, depending on the workload it may not be as space efficient. The proposed chaining technique has applications in information routing, collection tracking, context-aware systems, and peer-to-peer information exchange.