diff --git a/doc/TODO b/doc/TODO index 6b019054952..94bd85fc2f2 100644 --- a/doc/TODO +++ b/doc/TODO @@ -2,7 +2,7 @@ PostgreSQL TODO List ==================== Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us) -Last updated: Tue May 10 18:26:46 EDT 2005 +Last updated: Mon May 16 19:35:37 EDT 2005 The most recent version of this document can be viewed at http://www.postgresql.org/docs/faqs.TODO.html. diff --git a/doc/src/FAQ/TODO.html b/doc/src/FAQ/TODO.html index 4f5b74cb7aa..46a9d25e4b4 100644 --- a/doc/src/FAQ/TODO.html +++ b/doc/src/FAQ/TODO.html @@ -8,7 +8,7 @@
Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us)
-Last updated: Tue May 10 18:26:46 EDT 2005
+Last updated: Mon May 16 19:35:37 EDT 2005
The most recent version of this document can be viewed at
http://www.postgresql.org/docs/faqs.TODO.html.
@@ -82,7 +82,7 @@ first.
This would require a new global table that is dumped to flat file for @@ -122,7 +122,7 @@ first.
This is useful for checking PITR recovery.
MIN/MAX queries can already be rewritten as SELECT col FROM tab ORDER BY col {DESC} LIMIT 1. Completing this item involves doing this transformation automatically. @@ -300,7 +300,7 @@ first. order. Another method would be to sort heap ctids matching the index before accessing the heap rows.
-This feature allows separate indexes to be ANDed or ORed together. This is particularly useful for data warehousing applications that need to query the database in an many permutations. This feature scans an index @@ -345,7 +345,7 @@ first.
This is not SQL-spec but many DBMSs allow it.
-UPDATE already allows this (UPDATE...FROM) but we need similar functionality in DELETE. It's been agreed that the keyword should be USING, to avoid anything as confusing as DELETE FROM a FROM b. @@ -582,7 +582,7 @@ first. memory. This could exhaust memory for very large trigger queues. This item involves dumping large queues into files.
-We could use a fixed row count and a +/- count to follow MVCC visibility rules, or a single cached value could be used and @@ -684,7 +684,7 @@ first.
Larger local buffer cache sizes requires more efficient handling of local cache lookups. @@ -715,7 +715,7 @@ first. write lock. However, the read lock promotion to write lock could lead to deadlock situations.
-This allows vacuum to target specific pages for possible free space without requiring a sequential scan. @@ -742,7 +742,7 @@ first. while on non-SMP machines, the backend should sleep so the process holding the lock can complete and release it.
-i386-based SMP machines can generate excessive context switching caused by lock failure in high concurrency situations. This may be caused by CPU cache line invalidation inefficiencies. @@ -874,7 +874,7 @@ first.
This is probably not possible because 'gmake' and other compiler tools