Tom Lane wrote:
Good catch. But why are you using a hash index for this?
Just experimenting - I was trying to determine whether a hash index
would give better performance - the values are always unique except when
they're 0 and < > relations are never needed. That particular query
would have be
Shouldn't PostgreSQL behave in a different way in this case? (e.g. just
not use the index):
Table "public.forum_messages"
message_id | integer | not null default
nextval('forum_messages_message_id_seq'::text)
parent_userid
Hi,
I'm probably misintepreting the documented equivalence of PERFORM and
SELECT INTO as far as the special variable FOUND is concerned, but the
following 2 definitions do not seem to produce the same result.
create table blup ( t1 text, t2 text );
create function blup_unique2 (text,text) return
