4 ms·
This is very interesting. I have been writing a library [1] to bridge relational databases efficiently to GraphQL APIs, and adopted a similar approach towards
by lf-non 8y ago
This is very interesting.
I have been writing a library [1] to bridge relational databases efficiently to GraphQL APIs, and adopted a similar approach towards eliminating the redundancy in the schema definitions.
I currently rely on io-ts [2] which I also use for runtime verification of configuration options in an attempt to facilitate type verification to both JavaScript and Typescript consumers.
[1] https://gql-dal.github.io/greldal/ https://gql-dal.github.io/greldal/
[2] https://lorefnon.tech/2018/03/25/typescript-and-validations-at-runtime-boundaries/ https://lorefnon.tech/2018/03/25/typescript-and-validations-...
- acro5piano 8y agoGRelDAL is an interesting project! N+1 problem in GraphQL is difficult problem. It remind me Lighthouse PHP [1] which is a GraphQL framework top of Laravel. Lighthouse handles N+1 problem to create a lot of "union all" queries. [1] https://github.com/nuwave/lighthouse https://github.com/nuwave/lighthouse