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

newtglobal postgresql_contributors <postgresql_contributors@newtglobalcorp.com>

From: newtglobal postgresql_contributors <postgresql_contributors@newtglobalcorp.com>

To: pgsql-hackers@lists.postgresql.org

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

Date: 2025-03-12T07:23:32Z

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

The following review has been posted through the commitfest application:
make installcheck-world:  tested, failed
Implements feature:       tested, failed
Spec compliant:           tested, failed
Documentation:            tested, failed

Hi Yuya,
Tested this patch and noted that this patch significantly improves query planning time, especially as the number of partitions increases. While the impact is minimal for small partition counts (2–8), the improvement becomes substantial from 16 partitions onward, reaching up to ~86.6% reduction at 768 partitions. Larger partitions (512–1024) see a dramatic speedup, cutting planning time by over 2.7 seconds. The results confirm that the patch optimizes partitioned query execution efficiently. This enhancement is crucial for databases handling large partitioned tables, leading to better performance and scalability.
Regards,
NewtGlobal PostgreSQL contributors