Received: from styx.apartia.int (postfix@dyn-1-1-081.Vin.dialup.oleane.fr [195.25.4.81]) by hub.org (8.10.1/8.10.1) with ESMTP id e5P7rP198482 for ; Sun, 25 Jun 2000 03:53:25 -0400 (EDT) Received: by styx.apartia.int (Postfix, from userid 1000) id 2D9F652ED; Sun, 25 Jun 2000 09:52:45 +0200 (CEST) Date: Sun, 25 Jun 2000 09:52:45 +0200 From: Louis-David Mitterrand To: pgsql-sql@postgresql.org Subject: finding (and recycling) holes in sequences Message-ID: <20000625095245.A8162@styx> Reply-To: ldm@apartia.ch Mail-Followup-To: pgsql-sql@postgresql.org Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.2i X-Archive-Number: 200006/223 If one has a unique-id generating sequence that sometimes is bound to have holes in it (ie: it could happen that a nextval(seq) happens without a corresponding INSERT in the table), then how could one efficiently scan for these holes to recycle them in subsequent INSERTs? I'm just looking for a "standard" way of doing this if such a thing exists. TIA -- Louis-David Mitterrand - ldm@apartia.org - http://www.apartia.fr "For a list of the ways which technology has failed to improve our quality of life, press 3."