Chained forests for fast subsumption matching

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.

[1]  Nematollaah Shiri,et al.  Containment of Conjunctive Queries with Arithmetic Expressions , 2005, OTM Conferences.

[2]  Linda Torczon,et al.  An efficient representation for sparse sets , 1993, LOPL.

[3]  Robert Levinson,et al.  Partial order maintenance , 1989, SIGF.

[4]  Peter Brown,et al.  Triggering information by context , 1998, Personal Technologies.

[5]  Sasu Tarkoma,et al.  Optimizing content-based routers: posets and forests , 2006, Distributed Computing.

[6]  Christos Doulkeridis,et al.  Querying and Updating a Context-Aware Service Directory in Mobile Environments , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[7]  Mehdi Jazayeri,et al.  Mobile push: delivering content to mobile users , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[8]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[9]  Anind K. Dey,et al.  Understanding and Using Context , 2001, Personal and Ubiquitous Computing.

[10]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[11]  Rajeev Rastogi,et al.  Tree Pattern Aggregation for Scalable XML Data Dissemination , 2002, VLDB.

[12]  Sasu Tarkoma,et al.  Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching , 2006 .

[13]  Vom Fachbereich Informatik.  Large-Scale Content-Based Publish/Subscribe Systems , 2002 .

[14]  Ian Horrocks,et al.  A Software Framework for Matchmaking Based on Semantic Web Technology , 2004, Int. J. Electron. Commer..

[15]  Hector Garcia-Molina,et al.  Query Merging: Improving Query Subscription Processing in a Multicast Environment , 2003, IEEE Trans. Knowl. Data Eng..