Update FAQ.

diff --git a/doc/FAQ b/doc/FAQ
index 9b8539da9cb601fc9278f4cb18628fdf1c25645d..f59d74ff9a311274fb7d8b930f8d43073115d720 100644 (file)
--- a/doc/FAQ
+++ b/doc/FAQ
@@ -1,7 +1,7 @@
 
                 Frequently Asked Questions (FAQ) for PostgreSQL
                                        
-   Last updated: Tue May 22 17:50:25 EDT 2001
+   Last updated: Wed May 30 18:57:52 EDT 2001
    
    Current maintainer: Bruce Momjian (pgman@candle.pha.pa.us)
    
@@ -709,9 +709,9 @@ Maximum number of indexes on a table?    unlimited
    column statistics on its own, so VACUUM ANALYZE must be run to collect
    them periodically.
    
-   Indexes are usually not used for ORDER BY operations: a sequential
-   scan followed by an explicit sort is faster than an indexscan of all
-   tuples of a large table, because it takes fewer disk accesses.
+   Indexes are usually not used for ORDER BY or joins: a sequential scan
+   followed by an explicit sort is faster than an indexscan of all tuples
+   of a large table, because it takes fewer disk accesses.
    
    When using wild-card operators such as LIKE or ~, indices can only be
    used if the beginning of the search is anchored to the start of the

diff --git a/doc/src/FAQ/FAQ.html b/doc/src/FAQ/FAQ.html
index e4989d5a1aa0703895be1a6dbd18628555f83a19..932b2b7856db3d4fa266bc214a043110ef56a79f 100644 (file)
--- a/doc/src/FAQ/FAQ.html
+++ b/doc/src/FAQ/FAQ.html
@@ -12,7 +12,7 @@
   alink="#0000FF">
     <H1>Frequently Asked Questions (FAQ) for PostgreSQL</H1>
 
-    <P>Last updated: Tue May 22 17:50:25 EDT 2001</P>
+    <P>Last updated: Wed May 30 18:57:52 EDT 2001</P>
 
     <P>Current maintainer: Bruce Momjian (<A href=
     "mailto:pgman@candle.pha.pa.us">pgman@candle.pha.pa.us</A>)<BR>
@@ -908,7 +908,7 @@ Maximum number of indexes on a table?    unlimited
     periodically.</P>
 
     <P>Indexes are usually not used for <SMALL>ORDER BY</SMALL>
-    operations: a sequential scan followed by an explicit sort is
+    or joins: a sequential scan followed by an explicit sort is
     faster than an indexscan of all tuples of a large table, because it
     takes fewer disk accesses.</P>