Composite Subscription and Matching Algorithm for RFID Applications

Abstract

RFID technology facilitates monitoring and managing products. In most RFID applications, users pay much attention to temporal and logical event patterns, which is further strengthened by highly temporal RFID data. If RFID events or other kinds of events are disseminated to users through Pub/Sub service, visibility of product states will be greatly increased and fast processing these events will become possible. However, the traditional Pub/Sub systems cannot support composite events involving abundant temporal constraints. Therefore, they cannot fully meet the needs of RFID applications. Aiming at RFID-related application scenarios, this paper designs a composite subscription language embedded with diversified temporal operators and proposes a matching algorithm for detecting composite events which has been implemented in our Pub/Sub system OncePubSub. Performance evaluation results indicate our algorithm is more efficient than the two systems based on Siena and JESS respectively.