| From: | "Simon Riggs" <simon(at)2ndquadrant(dot)com> |
|---|---|
| To: | "Martijn van Oosterhout" <kleptog(at)svana(dot)org> |
| Cc: | <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Frequent Update Project: Design Overview of HOTUpdates |
| Date: | 2006-11-09 17:57:17 |
| Message-ID: | 1163095038.3634.490.camel@silverbirch.site |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, 2006-11-09 at 18:49 +0100, Martijn van Oosterhout wrote:
> Nice idea, just one question:
> It seems to me that bitmap index scans will get these same
> characteristics also, right? The bitmap scan will have to follow the
> chain of any possibly matching tuple in any of the blocks that are in
> the bitmap, right?
Yes, they would identify the root tuples. The whole chain has matching
index values, by definition, so the re-evaluation for lossy bitmaps will
work just the same before the actual tuple is retrieved by walking the
chain (if required).
--
Simon Riggs
EnterpriseDB http://www.enterprisedb.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Simon Riggs | 2006-11-09 18:05:22 | Re: Introducing an advanced Frequent Update Optimization |
| Previous Message | Martijn van Oosterhout | 2006-11-09 17:49:45 | Re: Frequent Update Project: Design Overview of HOT Updates |