Research Article
Concept Tree-Based Event Matching Algorithm in Publish/Subscribe Systems
Algorithm 4
Insert string constraint.
| insertStringConstraint(attribute, value, id){ | (1) | name = root(attribute); | (2) | map = m3.get(name); | (3) | if map is null{ | (4) | map = new Map < String, BitSet>( ); | (5) | m3.put(name, map); | (6) | } | (7) | sid = map.get(value); | (8) | if sid is null{ | (9) | sid = new BitSet( ); | (10) | map.put(value, sid); | (11) | } | (12) | sid.set(id); | (13) | aid = map.get(∗); | (14) | if aid is null{ | (15) | aid = new BitSet( ); | (16) | map.put(∗, aid); | (17) | } | (18) | aid.set(id); | | } |
|