Hai cercato la traduzione di optimization da Coreano a Inglese

dba_optimize() returns true or false, if the optimization succeeds or fails, respectively.
see also: dba_sync()

you can include optimization options in the compilation command, although these have been omitted in this example (but some are included in the makefile template described in an earlier section).
you can include optimization options in the compilation command, although these have been omitted in this example (but some are included in the makefile template described in an earlier section).

certain items that may appear in patterns are more efficient than others. it is more efficient to use a character class like [aeiou] than a set of alternatives such as (a_bar_e_bar_i_bar_o_bar_u). in general, the simplest construction that provides the required behaviour is usually the most efficient. jeffrey friedl's book contains a lot of discussion about optimizing regular expressions for efficient performance. when a pattern begins with .* and the pcre_dotall option is set, the pattern is implicitly anchored by pcre, since it can match only at the start of a subject string. however, if pcre_dotall is not set, pcre cannot make this optimization, because the. metacharacter does not then match a newline, and if the subject string contains newlines, the pattern may match from the character immediately following one of them instead of from the very start. for example, the pattern (.*) second matches the subject "first\nand second" (where \n stands for a newline character) with the first captured substring being "and". in order to do this, pcre has to retry the match starting after every newline in the subject. if you are using such a pattern with subject strings that do not contain newlines, the best performance is obtained by setting pcre_dotall, or starting the pattern with ^.* to indicate explicit anchoring. that saves pcre from having to scan along the subject looking for a newline to restart at. beware of patterns that contain nested indefinite repeats. these can take a long time to run when applied to a string that does not match. consider the pattern fragment (a+)* this can match "aaaa" in 33 different ways, and this number increases very rapidly as the string gets longer. (the * repeat can match 0, 1, 2, 3, or 4 times, and for each of those cases other than 0, the + repeats can match different numbers of times.) when the remainder of the pattern is such that the entire match is going to fail, pcre has in principle to try every possible variation, and this can take an extremely long time. an optimization catches some of the more simple cases such as (a+)*b where a literal character follows. before embarking on the standard matching procedure, pcre checks that there is a "b" later in the subject string, and if there is not, it fails the match immediately. however, when there is no following literal this optimization cannot be used. you can see the difference by comparing the behaviour of (a+)*\d with the pattern above. the former gives a failure almost instantly when applied to a whole line of "a" characters, whereas the latter takes an appreciable time with strings longer than about 20 characters.
the former gives a failure almost instantly when applied to a whole line of "a" characters, whereas the latter takes an appreciable time with strings longer than about 20 characters.