database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-06-25 01:02:05 +03:00
Code Activity

Add calcluation of bitmap storage capacity.

Browse Source 
<   be cleared when a heap tuple is expired.  Another idea is to maintain
<   a bitmap of heap pages where all rows are visible to all backends,
<   and allow index lookups to reference that bitmap to avoid heap
<   lookups, perhaps the same bitmap we might add someday to determine
<   which heap pages need vacuuming.
>   be cleared when a heap tuple is expired.
>
>   Another idea is to maintain a bitmap of heap pages where all rows
>   are visible to all backends, and allow index lookups to reference
>   that bitmap to avoid heap lookups, perhaps the same bitmap we might
>   add someday to determine which heap pages need vacuuming.  Frequently
>   accessed bitmaps would have to be stored in shared memory.  One 8k
>   page of bitmaps could track 512MB of heap pages.
This commit is contained in:
Bruce Momjian
2005-12-02 04:28:19 +00:00
parent cf17131767
commit 9322a04759
2 changed files with 18 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
doc/TODO
View File

@ -2,7 +2,7 @@
PostgreSQL TODO List PostgreSQL TODO List
==================== ====================
Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us) Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us)
Last updated: Thu Dec 1 17:30:23 EST 2005 Last updated: Thu Dec 1 23:28:03 EST 2005
The most recent version of this document can be viewed at The most recent version of this document can be viewed at
http://www.postgresql.org/docs/faqs.TODO.html. http://www.postgresql.org/docs/faqs.TODO.html.
@ -862,11 +862,14 @@ Cache Usage
the heap. One way to allow this is to set a bit on index tuples the heap. One way to allow this is to set a bit on index tuples
to indicate if a tuple is currently visible to all transactions to indicate if a tuple is currently visible to all transactions
when the first valid heap lookup happens. This bit would have to when the first valid heap lookup happens. This bit would have to
be cleared when a heap tuple is expired. Another idea is to maintain be cleared when a heap tuple is expired.
a bitmap of heap pages where all rows are visible to all backends,
and allow index lookups to reference that bitmap to avoid heap Another idea is to maintain a bitmap of heap pages where all rows
lookups, perhaps the same bitmap we might add someday to determine are visible to all backends, and allow index lookups to reference
which heap pages need vacuuming. that bitmap to avoid heap lookups, perhaps the same bitmap we might
add someday to determine which heap pages need vacuuming. Frequently
accessed bitmaps would have to be stored in shared memory. One 8k
page of bitmaps could track 512MB of heap pages.
* Consider automatic caching of queries at various levels: * Consider automatic caching of queries at various levels:

15
doc/src/FAQ/TODO.html
View File

@ -8,7 +8,7 @@
<body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF"> <body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF">
<h1><a name="section_1">PostgreSQL TODO List</a></h1> <h1><a name="section_1">PostgreSQL TODO List</a></h1>
<p>Current maintainer: Bruce Momjian (<a href="mailto:pgman@candle.pha.pa.us">pgman@candle.pha.pa.us</a>)<br/> <p>Current maintainer: Bruce Momjian (<a href="mailto:pgman@candle.pha.pa.us">pgman@candle.pha.pa.us</a>)<br/>
Last updated: Thu Dec 1 17:30:23 EST 2005 Last updated: Thu Dec 1 23:28:03 EST 2005
</p> </p>
<p>The most recent version of this document can be viewed at<br/> <p>The most recent version of this document can be viewed at<br/>
<a href="http://www.postgresql.org/docs/faqs.TODO.html">http://www.postgresql.org/docs/faqs.TODO.html</a>. <a href="http://www.postgresql.org/docs/faqs.TODO.html">http://www.postgresql.org/docs/faqs.TODO.html</a>.
@ -781,11 +781,14 @@ first.
the heap. One way to allow this is to set a bit on index tuples the heap. One way to allow this is to set a bit on index tuples
to indicate if a tuple is currently visible to all transactions to indicate if a tuple is currently visible to all transactions
when the first valid heap lookup happens. This bit would have to when the first valid heap lookup happens. This bit would have to
be cleared when a heap tuple is expired. Another idea is to maintain be cleared when a heap tuple is expired.
a bitmap of heap pages where all rows are visible to all backends, </p>
and allow index lookups to reference that bitmap to avoid heap <p> Another idea is to maintain a bitmap of heap pages where all rows
lookups, perhaps the same bitmap we might add someday to determine are visible to all backends, and allow index lookups to reference
which heap pages need vacuuming. that bitmap to avoid heap lookups, perhaps the same bitmap we might
add someday to determine which heap pages need vacuuming. Frequently
accessed bitmaps would have to be stored in shared memory. One 8k
page of bitmaps could track 512MB of heap pages.
</p> </p>
</li><li>Consider automatic caching of queries at various levels: </li><li>Consider automatic caching of queries at various levels:
<ul> <ul>