PPL, I skipped through the entire master table before calling
relate4Top, but it did not make any (significant) difference,
unfortunately.
Here are some more numbers that help to understand the problem.
I am generating a query based on a master table of about 17,000 records
and two slaves. One slave has the same number of records the second has
170,000 records. The latter table is opened and referred to in the
query string four times (with different aliases). For the following
numbers the query set comprises 13 composite records. I am applying
both memory and query optimization. I call relate4Top and then skip
through the table to count the records. Skipping backwards is disabled.
Sorting with Index:
First call:
relate4Top: 4.226 secs
Skipping through query set (13 records!): 66.216 secs
Consecutive calls:
relate4Top: 0.030 secs
Skipping through query set: 1.843 secs
Sorting with relate4SortSet:
First call:
relate4Top:70.601 secs
Skipping through query set: 0.001 secs
Consecutive calls:
relate4Top: 1.873 secs
Skipping through query set: 0.001 secs
So with the given data, the first call of relate4Top and skipping
through the table takes roughly 70 seconds, no matter whether I sort
with the master table's index or with relate4SortSet. Consecutive calls
take about 1.85 seconds.
Does anybody know a way of getting the first call (and possibly the
following calls) faster? Is anybody from Sequiter around to hint me to
a solution to the problem?
Any advice would be greatly appreciated!
Markus
|
