From: stefan
Date: February 27 2006 4:29pm
Subject: svn commit - mysqldoc@docsrva: r1450 - trunk/refman-5.1
List-Archive: http://lists.mysql.com/commits/3202
Message-Id: <200602271629.k1RGTXfv032283@docsrva.mysql.com>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Author: shinz
Date: 2006-02-27 17:29:33 +0100 (Mon, 27 Feb 2006)
New Revision: 1450

Log:
Review Partition Pruning section

Modified:
   trunk/refman-5.1/partitioning.xml

Modified: trunk/refman-5.1/partitioning.xml
===================================================================
--- trunk/refman-5.1/partitioning.xml	2006-02-27 16:19:18 UTC (rev 1449)
+++ trunk/refman-5.1/partitioning.xml	2006-02-27 16:29:33 UTC (rev 1450)
@@ -3402,14 +3402,14 @@
       will be in either of the partitions <literal>p0</literal> or
       <literal>p3</literal>; that is, we need to search only in
       partitions <literal>p1</literal> and <literal>p2</literal> to find
-      matching rows. By doing so, it is possible to expend much time
-      time and effort in finding matching rows than it is to scan all
-      partitions in the table. This <quote>cutting away</quote> of
-      unneeded partitions is known as <firstterm>pruning</firstterm>.
-      When the optimiser can make use of partition pruning in performing
-      a query, execution of the query can be an order of magnitude
-      faster than the same query against a non-partitioned table
-      containing the same column definitions and data.
+      matching rows. By doing so, it is possible to expend much time and
+      effort in finding matching rows than it is to scan all partitions
+      in the table. This <quote>cutting away</quote> of unneeded
+      partitions is known as <firstterm>pruning</firstterm>. When the
+      optimiser can make use of partition pruning in performing a query,
+      execution of the query can be an order of magnitude faster than
+      the same query against a non-partitioned table containing the same
+      column definitions and data.
     </para>
 
     <para>
@@ -3439,21 +3439,20 @@
     </itemizedlist>
 
     <para>
-      In the first case, the optimiser simply evaluates evaluates the
-      partitioning expression for the value given, determines which
-      partition contains that value, and scans only this partition. In
-      the second case, the optimiser evaluates the partitioning
-      expression for each value in the list, creates a list of matching
-      partitions, and then scans only the partitions in this partition
-      list.
+      In the first case, the optimizer simply evaluates the partitioning
+      expression for the value given, determines which partition
+      contains that value, and scans only this partition. In the second
+      case, the optimizer evaluates the partitioning expression for each
+      value in the list, creates a list of matching partitions, and then
+      scans only the partitions in this partition list.
     </para>
 
     <para>
-      Pruning can also be applied to short ranges, which the optimiser
+      Pruning can also be applied to short ranges, which the optimizer
       can convert into equivalent lists of values. For instance, in the
       previous example, the <literal>WHERE</literal> clause can be
       converted to <literal>WHERE region_code IN (125, 126, 127, 128,
-      129, 130)</literal>. Then the optimiser can determine that the
+      129, 130)</literal>. Then the optimizer can determine that the
       first three values in the list are found in partition
       <literal>p1</literal>, the remaining three values in partition
       <literal>p2</literal>, and that the other partitions contain no
@@ -3462,10 +3461,10 @@
     </para>
 
     <para>
-      This type of optimisation can be applied whenever the partitioning
+      This type of optimization can be applied whenever the partitioning
       expression consists of an equality or a range which can be reduced
       to a set of equalities. It can also be employed when the
-      partitioning expression represents an incresing or decreasing
+      partitioning expression represents an increasing or decreasing
       relationship or uses a function such as <literal>YEAR()</literal>
       or <literal>TO_DAYS()</literal> that produces an integer value
       when applied to a <literal>DATE</literal> or
@@ -3509,7 +3508,7 @@
 </programlisting>
 
     <para>
-      In the case of the last query, the optimiser can also act as
+      In the case of the last query, the optimizer can also act as
       follows:
     </para>
 
@@ -3589,7 +3588,7 @@
 
     <para>
       For a query such as <literal>SELECT * FROM t3 WHERE region_code
-      BETWEEN 1 AND 3</literal>, the optimiser determines in which
+      BETWEEN 1 AND 3</literal>, the optimizer determines in which
       partitions the values 1, 2, and 3 are found (<literal>r0</literal>
       and <literal>r1</literal>) and skips the remaining ones
       (<literal>r2</literal> and <literal>r3</literal>).