On Tue, 17 Jul 2001, Tom Lane wrote:
> Seems like a bad idea; it'll slow down deletes quite a lot, no? Do you
> really want to (for example) parse every SQL function in the system to
> see if it refers to a table being dropped? Why would we want to do that
> work over again for every such delete, rather than doing it once when
> an object is created and storing the info in a table? Also consider
> that what you are proposing is (at least) an O(N^2) algorithm when there
> are a large number of objects.
I think it's actually O(N^M) where there are N system objects and a chain
of M dependencies (A depends on B which depends on C => M = 3).
Take care,
Bill