Match query shapes for data science

[Theodus]

Our current efforts for tiered subscriptions require identifying "query shapes". My understanding is that most queries are nearly identical, but are differentiated by variables, skip & first filters, etc. We will need to add a deterministic algorithm for extracting a query shape for each query so that we can provide richer feedback to the user.

I've heard graph-node might have some code to do this. So we should first check if that would fit our use-case. Otherwise, we might need to come up with something from scratch.

Other notes

• Current GraphQL query parsing code, used to extract block constraints: https://github.com/edgeandnode/graph-gateway/blob/main/graph-gateway/src/block_constraints.rs