Re: Best database structure for timely ordered values

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Reiner Dassing <dassing(at)wettzell(dot)ifag(dot)de>
Cc: pgsql-sql(at)postgresql(dot)org
Subject: Re: Best database structure for timely ordered values
Date: 2000-12-18 14:56:55
Message-ID: 18883.977151415@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Reiner Dassing <dassing(at)wettzell(dot)ifag(dot)de> 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

In response to

Responses

Browse pgsql-sql by date

  From Date Subject
Next Message Alessio Bragadini 2000-12-18 15:16:52 Re: Confused by timezones
Previous Message Frank Joerdens 2000-12-18 10:43:21 Re: Subqueries in Non-SELECT Queries