Re: Organize working memory under per-PlanState context

From: Andrei Lepikhov <lepihov(at)gmail(dot)com>
To: Chao Li <li(dot)evan(dot)chao(at)gmail(dot)com>, Jeff Davis <pgsql(at)j-davis(dot)com>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: Organize working memory under per-PlanState context
Date: 2025-08-20 07:22:38
Message-ID: 7dc34031-fe8b-4ba5-b3d1-2ce87ce91ed8@gmail.com
Views: Whole Thread | Raw Message | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

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

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Andrei Lepikhov 2025-08-20 07:33:12 Re: Organize working memory under per-PlanState context
Previous Message Andrei Lepikhov 2025-08-20 07:14:29 Re: RFC: extensible planner state