Swap to async graphql parse checking

[miratepuffin]

What changes were proposed in this pull request?

Why are the changes needed?

Does this PR introduce any user-facing change? If yes is this documented?

How was this patch tested?

Are there any further changes required?

[github-actions]

⚠️ Performance Alert ⚠️

Possible performance regression was detected for benchmark 'Rust Benchmark'.
Benchmark result of this commit is worse than the previous benchmark result exceeding threshold 2.

Benchmark suite	Current: a6a5ce0	Previous: 9823ef7	Ratio
lotr_graph/num_edges	5 ns/iter (± 0)	0 ns/iter (± 0)	+∞
lotr_graph/num_nodes	126 ns/iter (± 31)	1 ns/iter (± 0)	126
lotr_graph/graph_latest	3 ns/iter (± 0)	0 ns/iter (± 0)	+∞
lotr_graph_window_100/num_edges	30 ns/iter (± 0)	8 ns/iter (± 0)	3.75
lotr_graph_window_100/num_nodes	146 ns/iter (± 33)	5 ns/iter (± 0)	29.20
lotr_graph_window_100/has_node_existing	45 ns/iter (± 0)	22 ns/iter (± 0)	2.05
lotr_graph_window_10/has_node_existing	147 ns/iter (± 8)	62 ns/iter (± 11)	2.37
lotr_graph_window_10/iterate nodes	38569 ns/iter (± 319)	11339 ns/iter (± 40)	3.40
lotr_graph_window_10/iterate edges	99760 ns/iter (± 1681)	48684 ns/iter (± 211)	2.05
lotr_graph_subgraph_10pc/has_edge_existing	253 ns/iter (± 10)	93 ns/iter (± 1)	2.72
lotr_graph_subgraph_10pc/num_nodes	125 ns/iter (± 26)	4 ns/iter (± 0)	31.25
lotr_graph_subgraph_10pc/has_node_existing	117 ns/iter (± 1)	34 ns/iter (± 0)	3.44
lotr_graph_subgraph_10pc/iterate nodes	2701 ns/iter (± 94)	839 ns/iter (± 5)	3.22
lotr_graph_subgraph_10pc_windowed/has_node_existing	142 ns/iter (± 8)	62 ns/iter (± 14)	2.29
lotr_graph_subgraph_10pc_windowed/iterate nodes	4804 ns/iter (± 97)	1365 ns/iter (± 3)	3.52
lotr_graph_window_50_layered/num_edges_temporal	156291 ns/iter (± 2532)	70121 ns/iter (± 7586)	2.23
lotr_graph_window_50_layered/num_nodes	62322 ns/iter (± 1382)	21435 ns/iter (± 536)	2.91
lotr_graph_window_50_layered/has_node_existing	899 ns/iter (± 92)	129 ns/iter (± 12)	6.97
lotr_graph_window_50_layered/max_id	69301 ns/iter (± 970)	25556 ns/iter (± 252)	2.71
lotr_graph_window_50_layered/iterate nodes	138926 ns/iter (± 523)	19308 ns/iter (± 47)	7.20
lotr_graph_window_50_layered/iterate edges	195807 ns/iter (± 5957)	83616 ns/iter (± 1318)	2.34
lotr_graph_window_50_layered/graph_latest	105325 ns/iter (± 1142)	36649 ns/iter (± 916)	2.87
lotr_graph_persistent_window_50_layered/num_edges_temporal	719551 ns/iter (± 11366)	192686 ns/iter (± 1569)	3.73
lotr_graph_persistent_window_50_layered/num_nodes	82455 ns/iter (± 1710)	31517 ns/iter (± 779)	2.62
lotr_graph_persistent_window_50_layered/has_node_existing	1075 ns/iter (± 175)	174 ns/iter (± 83)	6.18
lotr_graph_persistent_window_50_layered/max_id	90172 ns/iter (± 899)	38024 ns/iter (± 490)	2.37
lotr_graph_persistent_window_50_layered/iterate nodes	186765 ns/iter (± 3478)	35886 ns/iter (± 191)	5.20
lotr_graph_persistent_window_50_layered/iterate edges	196822 ns/iter (± 1060)	84161 ns/iter (± 596)	2.34
lotr_graph_persistent_window_50_layered/iterate_exploded_edges	3470225 ns/iter (± 4823)	1659940 ns/iter (± 19402)	2.09
lotr_graph_persistent_window_50_layered/graph_latest	157954 ns/iter (± 1871)	57549 ns/iter (± 4809)	2.74
lotr_graph_persistent_window_50_layered_materialise/materialize	12892951 ns/iter (± 117783)	5298035 ns/iter (± 147912)	2.43
lotr_graph/proto_encode	5891290 ns/iter (± 136786)	1157897 ns/iter (± 73709)	5.09

This comment was automatically generated by workflow using github-action-benchmark.