Add description for concurrent sequential scans:

bmomjian · bmomjian · commit 7a4c34c97ca5 · 2005-04-25T01:42:41.000Z
&gt;   One possible implementation is to start sequential scans from the lowest
&gt;   numbered buffer in the shared cache, and when reaching the end wrap
&gt;   around to the beginning, rather than always starting sequential scans
&gt;   at the start of the table.
diff --git a/doc/TODO b/doc/TODO
@@ -2,7 +2,7 @@
 PostgreSQL TODO List
 ====================
 Current maintainer:	Bruce Momjian (pgman@candle.pha.pa.us)
-Last updated:		Sun Apr 24 08:39:04 EDT 2005
+Last updated:		Sun Apr 24 21:42:27 EDT 2005
 
 The most recent version of this document can be viewed at
 http://www.postgresql.org/docs/faqs.TODO.html.
@@ -740,6 +740,10 @@ Cache
 * Allow sequential scans to take advantage of other concurrent
   sequentiqal scans, also called "Synchronised Scanning"
 
+  One possible implementation is to start sequential scans from the lowest
+  numbered buffer in the shared cache, and when reaching the end wrap
+  around to the beginning, rather than always starting sequential scans
+  at the start of the table.
 
 Vacuum
 ======
diff --git a/doc/src/FAQ/TODO.html b/doc/src/FAQ/TODO.html
@@ -8,7 +8,7 @@
 <body bgcolor="#FFFFFF" text="#000000" link="#FF0000" vlink="#A00000" alink="#0000FF">
 <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/>
-Last updated:           Sun Apr 24 08:39:04 EDT 2005
+Last updated:           Sun Apr 24 21:42:27 EDT 2005
 </p>
 <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>.
@@ -677,6 +677,11 @@ <h1><a name="section_13">Cache</a></h1>
 </p>
   </li><li>Allow sequential scans to take advantage of other concurrent
   sequentiqal scans, also called "Synchronised Scanning"
+<p>  One possible implementation is to start sequential scans from the lowest
+  numbered buffer in the shared cache, and when reaching the end wrap
+  around to the beginning, rather than always starting sequential scans
+  at the start of the table.
+</p>
 </li></ul>
 <h1><a name="section_14">Vacuum</a></h1>
 
