Re: select/update performance?

From: Rob Fielding <rob(at)dsvr(dot)net>
To: Bjørn T Johansen <btj(at)havleik(dot)no>
Cc: pgsql-general(at)postgresql(dot)org
Subject: Re: select/update performance?
Date: 2003-11-05 10:46:10
Message-ID: 3FA8D4F2.7080600@dsvr.net
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Bjørn T Johansen wrote:
> Yes, but the table in question have 3 PK and only one that needs this
> "sequence" so I just thought instead of getting holes in the IDs I just
> manually handle this counter somehow.. Not a big deal but... :)

You'd only get holes if you keep making nextval requests without using
the value - say by issuing rollback. The problem with holes is actually
the feature of uniqueness SEQUENCES provides. Perhaps you judge that
there is too high a chance of rollback to create a sufficient number of
holes to warrant not using a SEQUENCE.

It's all down to your application and specific situation I guess however
your counter table idea sounds exactly like what SEQUENCE provides,
without any of the guarantees.

I think I'd still recommend using a SEQUENCE for anything but the most
profound reason :)

--

Rob Fielding
rob(at)dsvr(dot)net Development Designer Servers Ltd

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Paul Olamba 2003-11-05 10:59:50 Matlab Mex Interface
Previous Message Richard Huxton 2003-11-05 10:33:09 Re: question