Research Article
Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
| | Input: a merged flow graph and a matching tree | | | Output: the subgraph mappings of on | | (1) | if then | | (2) | Output ; | | (3) | else | | (4) | if then | | (5) | for each do | | (6) | if SNValid and RCValid then | | (7) | ; | | (8) | IncMatching (FG (.successor)); | | (9) | IncMatching (FG (.precursor)); | | (10) | else | | (11) | for each do | | (12) | if SNValid and RCValid then | | (13) | ; | | (14) | IncMatching (FG (.successor)) | | (15) | IncMatching (FG (.precursor)) |
|