Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph

Table 3

An example of FG construction algorithm.

Bottom		np						State (np)		SN (np)	Top
Up								CS (np)	FS (np)		Down
			1	1	1	1	1	1	1	1
			1	1	1	1	1	1	0	2
			1	1	1	1	1	1	0	3
			0	1	1	1	1	1	1	1
			0	1	1	1	1	0	0	2, 3
			0	0	1	1	1	1	1	1
			0	0	0	1	1	1	1	1
			0	0	0	1	1	1	1	2
			0	0	0	1	1	1	1	3
			0	0	0	0	1	1	1	1, 2, 3