Reduce exponential cost of pulling up deeply nested views

Title

Topic

Performance

Created

2021-04-18 20:18:57

Last modified

2021-07-06 18:23:54 (3 years, 2 months ago)

Latest email

2021-07-06 17:52:10 (3 years, 2 months ago)

Status

2021-07: Committed

Target version

Authors

Tom Lane (tgl)

Reviewers

Dean Rasheed (deanr)Become reviewer

Committer

Tom Lane (tgl)

Links

Emails

Planning time grows exponentially with levels of nested views: First at 2021-04-18 18:58:53 by "Joel Jacobson" <joel at compiler.org>
Latest at 2021-07-06 17:52:10 by Tom Lane <tgl at sss.pgh.pa.us>
Latest attachment (save-cycles-in-repeated-subquery-pullup-1.patch) at 2021-04-18 20:14:07 from Tom Lane <tgl at sss.pgh.pa.us>
Attachment (save-cycles-in-repeated-subquery-pullup-1.patch) at 2021-04-18 20:14:07 from Tom Lane <tgl at sss.pgh.pa.us> (Patch: Yes)

History

When	Who	What
2021-07-06 18:23:54	Tom Lane (tgl)	Closed in commitfest 2021-07 with status: Committed
2021-07-06 18:23:54	Tom Lane (tgl)	Changed committer to tgl
2021-07-06 17:22:39	Dean Rasheed (deanr)	Added deanr as reviewer
2021-04-18 20:19:18	Tom Lane (tgl)	Changed authors to Tom Lane (tgl)
2021-04-18 20:18:58	Tom Lane (tgl)	Attached mail thread 797aff54-b49b-4914-9ff9-aa42564a4d7d@www.fastmail.com
2021-04-18 20:18:57	Tom Lane (tgl)	Created patch record