1
1
<!--
2
- $Header: /cvsroot/pgsql/doc/src/sgml/arch-dev.sgml,v 2.11 2000/12/21 22:55:26 petere Exp $
2
+ $Header: /cvsroot/pgsql/doc/src/sgml/arch-dev.sgml,v 2.12 2000/12/22 18:57:49 petere Exp $
3
3
-->
4
4
5
5
<chapter id="overview">
@@ -357,7 +357,7 @@ XXX merge in the figures later... - thomas 1999-01-29
357
357
the parser as input and steps recursively through it. If
358
358
a <literal>SelectStmt</literal> node is found, it is transformed
359
359
to a <literal>Query</literal>
360
- node which will be the top most node of the new data structure. Figure
360
+ node that will be the top most node of the new data structure. Figure
361
361
\ref{transformed} shows the transformed data structure (the part
362
362
for the transformed <firstterm>where clause</firstterm> is given in figure
363
363
\ref{transformed_where} because there was not enough space to show all
@@ -371,7 +371,7 @@ XXX merge in the figures later... - thomas 1999-01-29
371
371
created containing the relation name, the <firstterm>alias name</firstterm> and
372
372
the <firstterm>relation id</firstterm>. From now on the relation ids are used to
373
373
refer to the <firstterm>relations</firstterm> given in the query. All <abbrev>RTE</abbrev> nodes
374
- are collected in the <firstterm>range table entry list</firstterm> which is connected
374
+ are collected in the <firstterm>range table entry list</firstterm> that is connected
375
375
to the field <literal>rtable</literal> of the <literal>Query</literal> node. If a name of a
376
376
relation that is not known to the system is detected in the query an
377
377
error will be returned and the query processing will be aborted.
@@ -668,7 +668,7 @@ current context are performed.
668
668
</para>
669
669
670
670
<para>
671
- The top node of the plan is a <literal>MergeJoin</literal> node which has two
671
+ The top node of the plan is a <literal>MergeJoin</literal> node that has two
672
672
successors, one attached to the field <literal>lefttree</literal> and the second
673
673
attached to the field <literal>righttree</literal>. Each of the subnodes represents
674
674
one relation of the join. As mentioned above a merge sort
@@ -861,7 +861,7 @@ the {\it aggregate function} used in the query.
861
861
862
862
A check is made that every attribute grouped for appears only without
863
863
an {\it aggregate function} in the {\it targetlist} and that every
864
- attribute which appears without an {\it aggregate function} in the
864
+ attribute that appears without an {\it aggregate function} in the
865
865
{\it targetlist} is grouped for.
866
866
%
867
867
@@ -1050,7 +1050,7 @@ the {\it parser} transform the {\it operator tree} attached to the field
1050
1050
transformation of the {\it operator tree} for the {\it where clause}. This
1051
1051
is possible because both trees are built up by the same grammar rules
1052
1052
of the {\it parser} and are therefore compatible. Additional checks
1053
- which make sure that the {\it having clause} involves at least one
1053
+ that make sure that the {\it having clause} involves at least one
1054
1054
{\it aggregate function} etc. are performed at a later point in time
1055
1055
in the {\it planner/optimizer} stage. \\
1056
1056
\\
@@ -1061,7 +1061,7 @@ parts of the affected code are presented instead of the whole
1061
1061
functions. Every added source line will be marked by a {\tt '+'} at the
1062
1062
beginning of the line and every changed source line will be marked by
1063
1063
a {\tt '!'} throughout the following code listings. Whenever a part of
1064
- the code which is not relevant at the moment is skipped, three
1064
+ the code that is not relevant at the moment is skipped, three
1065
1065
vertical dots are inserted instead.
1066
1066
%
1067
1067
\pagebreak
@@ -1961,7 +1961,7 @@ node.
1961
1961
1962
1962
Unfortunately this is not the only thing to do. Remember from section
1963
1963
\ref{aggregates} {\it How Aggregate Functions are Implemented} that
1964
- the {\it targetlist} is searched for {\it aggregate functions} which
1964
+ the {\it targetlist} is searched for {\it aggregate functions} that
1965
1965
are appended to a list that will be attached to the field {\tt aggs}
1966
1966
of the {\tt AGG} node. This was sufficient as long as {\it aggregate
1967
1967
functions} have only been allowed to appear within the {\it
@@ -3158,7 +3158,7 @@ operators).
3158
3158
%
3159
3159
\end{itemize}
3160
3160
%
3161
- Here is a part of the grammar which is responsible for {\tt select}
3161
+ Here is a part of the grammar that is responsible for {\tt select}
3162
3162
statements having the code building up the data structures inserted:
3163
3163
%
3164
3164
\pagebreak
0 commit comments