From: | Thomas Kellerer <spam_eater(at)gmx(dot)net> |
---|---|
To: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: Best approach for a "gap-less" sequence |
Date: | 2006-08-12 13:29:03 |
Message-ID: | ebkl2v$7u1$1@sea.gmane.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Jorge Godoy wrote on 12.08.2006 01:33:
> I was trying to solve a problem on an old system and realized that there might
> be some better approach for doing what I need.
>
> We have some documents that need to be ordered sequentially and without gaps.
> I could use a sequence, but if the transaction fails then when I rollback the
> sequence will already have been incremented.
>
> So, today I have a control table and I acquire a SHARE ROW EXCLUSIVE lock to
> it, read the value, increase it, do what I need and then I COMMIT the
> transaction, ensuring that the sequence has no gaps.
>
> Is there a better way to guarantee that there will be no gaps in my sequence
> if something goes wrong with my transaction?
What do you do if a document gets deleted? Renumber the "following" documents so
that no gaps are present in the already used ids?
Thomas
From | Date | Subject | |
---|---|---|---|
Next Message | Harpreet Dhaliwal | 2006-08-12 13:43:15 | Re: Connection Object |
Previous Message | chris smith | 2006-08-12 13:24:46 | Re: Best approach for a "gap-less" sequence |