I also noticed that the code I'd written to build the cache lookup expression included a step to deform the outer tuple. This was unnecessary and slowed down the expression evaluation.
I thought it would be something like my 3rd suggestion on [1], however after
I read the code, it looked like no. Could you explain what changes it is?