-
Type:
Task
-
Resolution: Unresolved
-
Priority:
Major - P3
-
None
-
Affects Version/s: None
-
Component/s: None
-
None
-
Query Optimization
-
None
-
None
-
None
-
None
-
None
-
None
-
None
We already have benchmarks which test some worst-case scenarios. We need to review them and see if there's any missing cases. We should identify cases where our algorithms or data storage has quadratic or higher space or time complexity.
Then we should determine reasonable limits to apply inside of our type inference and type representation logic.
It is always valid to not perform type inference and bail, so the goal is to choose limits that are low enough such that type inference time is always minimal even in worst-case query shapes.
This could be as simple and as low as "up to 32 fields, up to 8 path components deep, up to 128 byte paths, up to 8 $ors, otherwise bail", but we need to validate that at those limits are low enough.