Re: No heap lookups on index

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Greg Stark <gsstark(at)mit(dot)edu>
Cc: David Scott <davids(at)apptechsys(dot)com>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: No heap lookups on index
Date: 2006-01-19 07:26:39
Message-ID: 11727.1137655599@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general pgsql-hackers

Greg Stark <gsstark(at)mit(dot)edu> writes:
> I wonder if the bitmap can actually be one bit per page actually.

Yeah, I think we'd agreed that per-page was the way to go. Per-tuple
bitmaps are painful to manage because of the variable number of tuples
per page. And really all you need to know is whether to read the page
or not --- once you have, examining multiple tuples on it doesn't cost
much.

regards, tom lane

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message David Fetter 2006-01-19 07:40:58 Re: [BUGS] Execution of stored procedures
Previous Message Tom Lane 2006-01-19 07:18:10 Re: No heap lookups on index

Browse pgsql-hackers by date

  From Date Subject
Next Message Martijn van Oosterhout 2006-01-19 07:27:17 Re: Surrogate keys (Was: enums)
Previous Message Tom Lane 2006-01-19 07:18:10 Re: No heap lookups on index