quick and dirty fix: Quadratic planning time for ordered paths over partitioned tables

Edit
ID 5516
Title quick and dirty fix: Quadratic planning time for ordered paths over partitioned tables
CI (CFBot) Not processed
Stats (from CFBot) Unknown
Topic Performance
Created 2025-01-22 15:48:06
Last modified 2025-02-03 14:27:36 (2 weeks, 4 days ago)
Latest email 2025-01-24 14:40:03 (4 weeks ago)
Status
2025-03: Rejected
Target version 18
Authors
Reviewers Become reviewer
Committer
Links
Emails
Quadratic planning time for ordered paths over partitioned tables
First at 2025-01-22 15:44:01 by Alexander Kuzmenkov <akuzmenkov at timescale.com>
Latest at 2025-01-24 14:40:03 by Alexander Kuzmenkov <akuzmenkov at timescale.com>
Latest attachment (v1-0001-Fix-quadratic-equivalence-member-search-for-parti.patch) at 2025-01-22 15:44:01 from Alexander Kuzmenkov <akuzmenkov at timescale.com>
    Attachment (v1-0001-Fix-quadratic-equivalence-member-search-for-parti.patch) at 2025-01-22 15:44:01 from Alexander Kuzmenkov <akuzmenkov at timescale.com> (Patch: Yes)
History
When Who What
2025-02-03 14:27:36 Alexander Kuzmenkov (akuzmenkov) Closed in commitfest 2025-03 with status: Rejected
2025-01-22 15:48:23 Alexander Kuzmenkov (akuzmenkov) Changed targetversion to 18
2025-01-22 15:48:06 Alexander Kuzmenkov (akuzmenkov) Attached mail thread CALzhyqzmZ6b9Sbp4jCORJV48t4kz2a1EqR3z4DUxX4RfRYR2xA@mail.gmail.com
2025-01-22 15:48:06 Alexander Kuzmenkov (akuzmenkov) Created patch record
Edit