You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
To enhance GemBrow performance with complex filters, we can break down the query in individual clauses, query their IDs, intersect those and then retrieve entities by IDs.
In practice, this will be greatly beneficial because a user only modify a clause at a time. All others will be retrieved from the cache.
This could be done in the Cached filtering service implementation as it make no sense to do this for uncached filters.
The text was updated successfully, but these errors were encountered:
When retrieving entities by ID, we have an opportunity to load then from the cache instead of querying the database.
This is only applicable of the results are not sorted.
I wonder if it would be possible to sort individual queries and combine the results from the by-ID query. This would allow us to always lookup the cache and only retrieve missed entities.
To enhance GemBrow performance with complex filters, we can break down the query in individual clauses, query their IDs, intersect those and then retrieve entities by IDs.
In practice, this will be greatly beneficial because a user only modify a clause at a time. All others will be retrieved from the cache.
This could be done in the Cached filtering service implementation as it make no sense to do this for uncached filters.
The text was updated successfully, but these errors were encountered: