| From: | mlw <markw(at)mohawksoft(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Musings |
| Date: | 2002-05-05 15:33:11 |
| Message-ID: | 3CD550B7.61D61DAE@mohawksoft.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Tom Lane wrote:
>
> mlw <markw(at)mohawksoft(dot)com> writes:
> > [Index] --> [Target]->[LRU]->[1]->[2]->[3]->[MRU]
>
RE: http://archives.postgresql.org/pgsql-hackers/2002-05/msg00030.php
There are a few variations, but it seems I am making the same assumptions as
Lincln Yeoh. So, you are saying that when a search for a specific tuple
happens, you have to hit every version of the tuple, no matter what? It isn't a
linked list?
I guess I don't understand. Why does it have to visit all of them? If ordering
them from newest tom oldest, and then take the first transaction ID that it
smaller then current transaction id, doesn't that work?
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Peter Eisentraut | 2002-05-05 17:52:09 | Re: pg_config Makefile includes hyphens in configure arguments |
| Previous Message | Tom Lane | 2002-05-05 14:51:23 | Re: Musings |