RETE-ADH: An Improvement to RETE for Composite Context-Aware Service

We propose a new pattern matching algorithm for composite context-aware services. The new algorithm, RETE-ADH, extends RETE to enhance systems that are based on the composite context-aware service architecture. RETE-ADH increases the speed of matching by searching only a subset of the rules that can...

Full description

Saved in:
Bibliographic Details
Published in:International journal of distributed sensor networks 2014-01, Vol.10 (4), p.507160
Main Authors: Kim, Milhan, Lee, Kiseong, Kim, Youngmin, Kim, Taejin, Lee, Yunseong, Cho, Sungrae, Lee, Chan-Gun
Format: Article
Language:English
Subjects:
Algorithms
Computer simulation
Design engineering
Engineering research
Matching
Matching theory
Methods
Networks
Offices
Parallel processing
Searching
Sensors
Ubiquitous computing
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a new pattern matching algorithm for composite context-aware services. The new algorithm, RETE-ADH, extends RETE to enhance systems that are based on the composite context-aware service architecture. RETE-ADH increases the speed of matching by searching only a subset of the rules that can be matched. In addition, RETE-ADH is scalable and suitable for parallelization. We describe the design of the proposed algorithm and present experimental results from a simulated smart office environment to compare the proposed algorithm with other pattern matching algorithms, showing that the proposed algorithm outperforms original RETE by 85%.
ISSN:1550-1329
1550-1477
1550-1477
DOI:10.1155/2014/507160