Click above to get retro games delivered to your door ever month!

   Large Memos and Text Files

   Among CFTS's strengths is its ability to index and search arbitrarily 
   long sections of text. Anxious to exploit this capability, some 
   developers have used CFTS to index large (4000 bytes+) memo fields. As 
   implemented the library works as it should, but performance can suffer 
   due to an increased number of aliases (invalid hits) returned by the 
   CFTS system. Nevertheless, even in these conditions, CFTS performance 
   remains superior to that of other searching schemes.

   If a developer is faced with this situation, the best advice, at least 
   for now, is to consider how these big blocks of text might be broken 
   down into smaller and more manageable chunks. For example, index on 
   paragraphs instead of pages or on whole documents. The user interface 
   may be more of a challenge to implement, but the payoff in ease-of- 
   use will be well worth the effort. An example, in which text is 
   divided on a line by line basis, can be seen in the SHOW2.PRG 
   demonstration program.

   Anything that can be done to reduce the ratio of source string length 
   to index size will help; perhaps indexing on only the first few 
   thousand characters of each memo field, or creating separate indexes 
   for data fields and memo fields. Also, remember that the more unique 
   (usually longer) the search (target) string is, the fewer aliases 
   returned and the faster the search can be completed.