Re: [HACKERS] Idea on how to simplify comparing two sets
От | Tom Lane |
---|---|
Тема | Re: [HACKERS] Idea on how to simplify comparing two sets |
Дата | |
Msg-id | 2580.1486570976@sss.pgh.pa.us обсуждение исходный текст |
Ответ на | Re: [HACKERS] Idea on how to simplify comparing two sets (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: [HACKERS] Idea on how to simplify comparing two sets
|
Список | pgsql-hackers |
Robert Haas <robertmhaas@gmail.com> writes: > On Wed, Feb 8, 2017 at 4:24 AM, Pantelis Theodosiou <ypercube@gmail.com> wrote: >> I'm not advocating it but I don't see how introducing new SQL keywords >> breaks backwards compatibility. > It does at least a little bit. Yes. I think a new set-operation keyword would inevitably have to be fully reserved --- UNION, INTERSECT, and EXCEPT all are --- which means that you'd break every application that has used that word as a table, column, or function name. Generally speaking, we try very darn hard not to introduce new reserved words that are not called out as reserved in the SQL standard. (And even for those, we've sometimes made the grammar jump through hoops so as not to reserve a word that we didn't reserve previously.) regards, tom lane
В списке pgsql-hackers по дате отправления: