Received: from sss.pgh.pa.us (sss.pgh.pa.us [209.114.132.154]) by mail.postgresql.org (8.11.1/8.11.1) with ESMTP id eBIEvR687262 for ; Mon, 18 Dec 2000 09:57:27 -0500 (EST) (envelope-from tgl@sss.pgh.pa.us) Received: from sss2.sss.pgh.pa.us (tgl@localhost [127.0.0.1]) by sss.pgh.pa.us (8.11.1/8.11.1) with ESMTP id eBIEutL18886; Mon, 18 Dec 2000 09:56:56 -0500 (EST) To: Reiner Dassing cc: pgsql-sql@postgresql.org Subject: Re: Best database structure for timely ordered values In-reply-to: <3A3DDE12.AD1278D9@wettzell.ifag.de> References: <3A3DDE12.AD1278D9@wettzell.ifag.de> Comments: In-reply-to Reiner Dassing message dated "Mon, 18 Dec 2000 10:51:14 +0100" Date: Mon, 18 Dec 2000 09:56:55 -0500 Message-ID: <18883.977151415@sss.pgh.pa.us> From: Tom Lane X-Archive-Number: 200012/194 X-Sequence-Number: 528 Reiner Dassing writes: > The primary index must be the epoch. > As there will be no deletion from this data I fear - due to the > internal representation of B-trees - the performance will degrade very > soon. Nonsense. btree should work just fine for that. Use a timestamp column for the primary key, and away you go. (Actually, time alone doesn't seem like it'd be necessarily unique, so maybe you don't want to call it a primary key. But certainly you can make a non-unique index on that column.) regards, tom lane