From: | Stephen Frost <sfrost(at)snowman(dot)net> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-hackers(at)postgresql(dot)org, Markus Wanner <markus(at)bluegap(dot)ch>, Alvaro Herrera <alvherre(at)commandprompt(dot)com> |
Subject: | Re: Column-Level Privileges |
Date: | 2009-01-20 19:01:55 |
Message-ID: | 20090120190155.GB32428@tamriel.snowman.net |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
* Tom Lane (tgl(at)sss(dot)pgh(dot)pa(dot)us) wrote:
> On the whole I think we have to go back to the original plan of
> recursively searching the query's expressions after we've finished all
> the transformations (and have a completed jointree to refer to). This
> is slightly annoying on the grounds of adding parsing overhead that's
> completely useless unless per-column privileges are in use. On the
> other hand, none of the workable alternatives are exactly overhead-free
> either.
>
> Comments?
Honestly, I like this approach. There is some additional overhead
during parsing, but it seems cleaner and more robust. Also, hopefully
in most cases where people are concerned about parse time they're
preparing their queries. If it's warrented, we could try doing
benchmarks to see how bad the impact is and if we need to do something
different. It doesn't strike me as likely to be a significant amount of
overhead though.
Thanks,
Stephen
From | Date | Subject | |
---|---|---|---|
Next Message | Heikki Linnakangas | 2009-01-20 19:01:58 | Re: Hot standby, RestoreBkpBlocks and cleanup locks |
Previous Message | Tom Lane | 2009-01-20 18:52:50 | Re: Column-Level Privileges |