Re: Why frequently updated tables are an issue

From: "Glen Parker" <glenebob(at)nwlink(dot)com>
To: <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Why frequently updated tables are an issue
Date: 2004-06-10 21:05:42
Message-ID: AJEKKAIECKNMBCEKADJPOEKECGAA.glenebob@nwlink.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

> It has been suggested in past to add such a visibility to index
> tuple header so
> that index and heaps can be cleaned out of order. In such a case
> other backround

It seems to me that the benefit of this wouldn't be all that impressive
*when accessing the cache*, which is the problem this discussion is about.
Disk access would occur more commonly with large tables, which I'll ignore.
Let's say total scan time for a query on a very dirty table is 100ms. It
seems safe to assume that the scan time for the index would be *roughly*
half that of the heap. If visibilty could be determined by looking at just
the index tuple, you'd cut you query scan time down to 50ms. When the clean
table case is 7ms total scan time, the difference between 50 and 100 ms is
not much of an issue; either way, it's still way to high!

> However increasing index footprint seems to be a tough sell.

And rightly so, IMO.

Glen Parker

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2004-06-10 21:19:22 Re: More vacuum.c refactoring
Previous Message Andreas Pflug 2004-06-10 20:54:54 Re: [PATCHES] serverlog function (log_destination file)