Refer to documentation Implementation
Presentation
Three values (in number of lines) are defined characterising the tables in which the memo test will run.
When the function execution is finished, a log file is generated containing two sections. The first part is a list of problems found, memo files sorted in alphabetic order and numbered. The log file provides information in the following form :
NNN local memo UUUUU.NAME for table XXXXXX (table title)
MESSAGE | DEFINITION |
*** WARN (MMMM) *** DESCRIPTION | Performance problem : the table has MMMM lines. |
*** PERF (MMMM) *** DESCRIPTION | Serious performance problem : the table has MMMM lines. |
*** CRIT (MMMM) *** DESCRIPTION | Critical performance problem : the table has MMMM lines. |
FIELD DESCRIPTION | Explanation |
No index for the filter on the field(s) FIELD1 FIELD2 … : Performance problem | Taking into account the specified filters no appropriate index exists. If the memo is useful and used frequently, it will be necessary to consider an optimization index. |
The left list sort key (KEY1) is different to the filter key (KEY2). | The database itself serves as a primary index (KEY2) to filter the data, then the data is sorted according to the KEY1 index in order to present the left list. This can be a performance problem if the index serving the filtering is not very selective (a large number of lines before being sorted). |
‘Different’ operator on the field FIELD1 ‘Like’ operator on the field FIELD1 | These two operators prevent the database using the index in a simple fashion on the value ranges; the performances can therefore be poor. |
'Or' operator between two conditions | The selection implies one or more conditions separated by 'or'. This type of request is in general pretty heavy in terms of performance. |
Selection on an expression : expression | This type of selection is not analyzed and must therefore be verified to know if a potential performance problems exits. |
Several tables in the memo verify the request | The selections are made on the joins. This type of request cannot be verified automatically by the utility : a manual verification is necessary to know if a performance problem could exist. |
The second part of the trace gives a hierarchical list of the previous problems (one line per problem). Found here is the problem number, the name of the memo in form of UUUUUU.NAME/TABLE The sort order is as follows :
This makes it possible to focus on the memos likely to provoke the most performance problems.
Close
Fields
The following fields are present on this tab :
Test options
| This size (in number of lines in the table) define the threshold above which an index problem in the memo is considered as critical from the point of view of the performances. |
| This size (in number of lines in the table) define the threshold above which an index problem in the memo is considered as serious from the point of view of the performances. |
| This size (in number of lines in the table) define the threshold below which an index problem in the memo is not considered as posing a problem from the point of view of the performances. From this threshold, a warning message will be displayed (if the following thresholds are not exceeded). |
Close