On 20/8/2025 07:38, Chao Li wrote:
> I know some memory must be retained until the entire query finishes. But
> those per-node memories, such as hash table, might be destroyed
> immediately after a node finishes.
I'm not sure I understand your reasoning clearly. How do you know that
the current subtree will not be rescanned with the same parameter set?
Building a hash table repeatedly may be pretty costly, no?
--
regards, Andrei Lepikhov
