An Efficient Primitive Subscription Matching Algorithm for RFID Applications
Pub/Sub systems can facilitate monitoring and managing objects for RFID applications. To fully support RFID applications, Pub/Sub systems should provide the means of subscribing RFID tags and the corresponding efficient matching algorithm. This paper provides the management mechanism and matching algorithm for primitive subscriptions whose specification permits to subscribe RFID codes. Our approach organizes clustered subscriptions into a covering forest and then executes primitive subscription matching on the basis of multi-level predicate indexes. Experiments are also conducted to evaluate the performance and overhead of our algorithm.
Fengliang Qi Beihong Jin Haibiao Chen Zhenyue Long
Institute of Software, Chinese Academy of Sciences, Beijing, China;Graduate University of Chinese Ac Institute of Software, Chinese Academy of Sciences, Beijing, China
国际会议
The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)
安徽黄山
英文
1137-1144
2008-11-18（万方平台首次上网日期，不代表论文的发表时间）