Re: Best database structure for timely ordered values

> > I assume the user is concerned about non-balanced btrees.  
> That is correct! 
> As I tested an example database with about 7 million entries on PostgreSQL V
> 6.5.2
> and the result of
> select count(*) from table;
> tooks about 3 minutes I have this concern.
> May be version 7.0.3 will give a better result.

The larger problem is that count(*) doesn't use the index at all.  It
just does a sequential scan of the heap table.

--  Bruce Momjian                        |  http://candle.pha.pa.us pgman@candle.pha.pa.us               |  (610)
853-3000+  If your life is a hard drive,     |  830 Blythe Avenue +  Christ can be your backup.        |  Drexel Hill,
Pennsylvania19026