Re: [SQL] Questions about vacuum analyze

From: Bruce Momjian <maillist(at)candle(dot)pha(dot)pa(dot)us>
To: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
Cc: "Steven M(dot) Wheeler" <swheeler(at)sabre(dot)com>, pgsql-sql(at)hub(dot)org
Subject: Re: [SQL] Questions about vacuum analyze
Date: 1999-10-11 16:14:28
Message-ID: 199910111614.MAA03460@candle.pha.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

> Bruce Momjian <maillist(at)candle(dot)pha(dot)pa(dot)us> writes:
> > The thing I liked about the existing algorithm is that it did the
> > sorting without the page faulting/thrashing caused by many sort
> > algorithms.
>
> Yes, I think we want to stick with the basic architecture of an
> initial replacement-selection filter operating in limited memory,
> followed by merge passes. I'm just thinking about how to reduce
> the amount of disk space chewed up by intermediate merge results...

Wonder how our create index does it. Seems it is must be similar.

--
Bruce Momjian | http://www.op.net/~candle
maillist(at)candle(dot)pha(dot)pa(dot)us | (610) 853-3000
+ If your life is a hard drive, | 830 Blythe Avenue
+ Christ can be your backup. | Drexel Hill, Pennsylvania 19026

In response to

Browse pgsql-sql by date

  From Date Subject
Next Message Nicolas Boretos 1999-10-11 18:39:10 Triggers on backend
Previous Message Tom Lane 1999-10-11 15:45:13 Re: [SQL] Questions about vacuum analyze