Currently all security and access related queries start with the users and then try to find a path to the element(s), which might be an expensive operation, as on average every node has many children. The opposite direction however should be more performant, as most nodes only have a single parent element.
This ticket requires the following tasks:
[ ] Try to manually create and run a query with the opposite relation direction.
[ ] Run the existing and new query multiple times for different data sets to find out, if the query speed changes.
[ ] Cold starts, network latency and caching might affect the performance.
[ ] Still missing indices will likely affect the performance.
Currently all security and access related queries start with the users and then try to find a path to the element(s), which might be an expensive operation, as on average every node has many children. The opposite direction however should be more performant, as most nodes only have a single parent element.
This ticket requires the following tasks: