Research Article
Incremental Graph Pattern Matching Algorithm for Big Graph Data
Algorithm 1
iDeltaP_IncGPM for edge deletions.
| (1) ; ; | | (2) for each deleted edge do | | (3) ; | | (4) and all ancestor nodes of ; | | (5) sort according to the inverse topological of ; | | (6) for each node in do | | (7) if then | | (8) for each do | | (9) check if keeps the child relationship of ; | | (10) if keeps the child relationship of then | | (11) ; ; | | (12) ; | | (13) else | | (14) for each do | | (15) if there exist which is a child of such that (, )∈, then | | (16) check if keeps the child relationship of ; | | (17) if keeps the child relationship of then | | (18) ; | | (19) ; | | (20) ; | | (21) repeatly filter according to the parent and child relationships of nodes in the | | subgraph constructed by to get added and updated and ; |
|