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. Categories and Subject Descriptors C.2.4 [Distributed Systems]: Matching; E.1 [Data Structures]: Trees

• Type: Conference
• Year: 2007
• Where: DEBS
• Authors: Sasu Tarkoma
• Keywords: Data Structures, DEBS 2007, Distributed And Parallel Computing, Partial Order, Subsumption-based Matching