Optimise Tiled insertion

[ZohebShaikh]

Currently almost all the get/post methods use get_entry which in turn uses the filter_for_access the query that is ran in this is find all the nodes I can access. This is exactly the place I think the code can be optimised.
If I do a get of /a/b/c It should only check that I have access for a ,b and c rather than get all the nodes that I have access to and then check if a,b and c are in the list.

[danielballan]

Agreed. In fact we used to have this optimization and temporarily removed it because the logic became complex to a point that we had concerns about achieving correctness.

The current architecture, in which Tiled can server arbitrary Python objects (not necessary with the Catalog) was nice for early prototypes and testing, but it's now too open-ended. Our theory is that, when we tighten down the architecture to assume that there is always a Catalog, it will be easier to implement this optimization and others in a simple way.

If you see a path there without waiting for said "architecture tightening", as long as it's testable and reviewable, I'm in favor.