Speeding up index lookups (OpenInsight 32-bit Specific)
At 27 DEC 2003 01:26:29PM Wilhelm Schmitt wrote:
In an application we let the user define search criteria. If the user defines a poor criteria, the index lookup (through btree.extract) might yield a 100,000 keys or more. In this case the server needs considerable time to communicate the user that the selection is most probably useless.
Questions:
1. Is there a direct way to tell the user that a certain indexed word has "n" ocurrences and allow the program to avoid the btree.extract at all?
2. Is there a way to tell btree.extract to abort - let's say after the first 1,000 ocurrences?
Regards
Wilhelm
At 27 DEC 2003 02:21PM [url=http://www.sprezzatura.com]The Sprezzatura Group[/url] wrote:
Btree.Read is probably what you need here - you get a node back at a time and can tweak your code appropriately.
World Leaders in all things RevSoft
