Is there a query optimiser?
TypeDB has a query optimiser where depending on the number of filters, segregates out the number of rows to traverse before the query is executed. This allows for blazingly fast performance.
Is this ability available within TigerGraph???
Here is an example where a QO does not exist. I was previously working with Dgraph. The issue outlined here (from another user who encountered similar performance issues): Soft deleting nodes + query performance - Dgraph - Discuss Dgraph
More and more filtering means that execution time (possibly) increases linearly? But at a minimum it does not decrease.
So what is the current case? Thanks