Optimizations

james120 · Post by **james120** » Sat Sep 18, 2004 9:24 pm

Can you give me some details as to how one should decide when to use predopttype? The manual explains what it does, but not when it would save time or why it defaults to off.

Also, what is the default for ignorecase? I assume that it is "true," since most of the time people would not care about case when searching, but I just want to check.

Finally, with btreecachesize, what is a "page"? I don't have a feel for what 20 pages (the default) would hold, or how much RAM that might translate to (assuming metamorph inverted index). Is there a rule of thumb that relates the type of index being used and the amount of RAM the machine has, to what btreecachesize should be set at?

Thanks,
James

Post by **John** » Mon Sep 20, 2004 11:17 am

Predopttype and btreecachesize do not generally need to be changed. They are available in the rare case that you are running into specific problems that they can solve.

The default for ignorecase is false, however it applies to traditional relational operators such as '=' or '>' rather than LIKE, which always ignores case.