Re: [PoC] Reducing planning time when tables have many partitions

Yuya Watari <watari.yuya@gmail.com>

From: Yuya Watari <watari.yuya@gmail.com>

To: David Rowley <dgrowleyml@gmail.com>

Cc: Tom Lane <tgl@sss.pgh.pa.us>, Andrey Lepikhov <a.lepikhov@postgrespro.ru>, PostgreSQL Developers <pgsql-hackers@lists.postgresql.org>

Date: 2022-07-27T06:07:03Z

Lists: pgsql-hackers

Commits

Same data as JSON: GET /api/v1/messages/:b64id/commits the thread's linked commits as JSON, with link sources. API reference →

Update wording in optimizer/README for EquivalenceClasses
- d7c04db27aeb 18.0 landed
Speedup child EquivalenceMember lookup in planner
- d69d45a5a956 18.0 landed
Allow planner to use Merge Append to efficiently implement UNION
- 66c0185a3d14 17.0 cited
Remove trailing zero words from Bitmapsets
- a8c09daa8bb1 17.0 cited
Make Vars be outer-join-aware.
- 2489d76c4906 16.0 cited
Avoid making commutatively-duplicate clauses in EquivalenceClasses.
- a5fc46414deb 16.0 cited

Dear David,

Thank you for sharing your new idea.

I agree that introducing a Bitmapset field may solve this problem. I
will try this approach in addition to previous ones.

Thank you again for helping me.

-- 
Best regards,
Yuya Watari