You can use SQL to perform a query that tells you how long an entry has been waiting for indexing.
To determine how long the oldest entry has waited in a deferred indexing queue
1 | Open and log in to SQL Advantage. |
2 | Enter this command: |
select q.mq_index, x.queue, oldest_entry = min (q.save_time)
from mq_index_queue q, mq_index x
where q.mq_index = x.mq_index
group by q.mq_index, x.queue
order by x.queue, q.mq_index
Here is an example of the results of this query:
mq_index |
queue |
oldest_entry |
altitle |
1 |
Mar 29 2002 11:41 |
author |
1 |
Mar 29 2002 11:41 |
mesh |
1 |
Mar 29 2002 11:41 |
series |
1 |
Mar 29 2002 11:41 |
subject |
1 |
Mar 29 2002 11:41 |
bibkw |
2 |
Mar 29 2002 11:55 |
unifath |
2 |
Mar 29 2002 11:55 |
unifbib |
2 |
Mar 29 2002 11:55 |
The results of this example indicate that you have reasonably balanced queues. You split a queue with these results only if you want to have a small group of indexes indexed more quickly.
This example shows results of the same query with a queue that is significantly behind:
mq_index |
queue |
oldest_entry |
altitle |
1 |
Mar 29 2002 11:41 |
author |
1 |
Mar 29 2002 11:41 |
mesh |
1 |
Mar 29 2002 11:41 |
series |
1 |
Mar 29 2002 11:41 |
subject |
1 |
Mar 29 2002 11:41 |
bibkw |
2 |
Mar 29 2002 6:55 |
unifath |
2 |
Mar 29 2002 6:55 |
unifbib |
2 |
Mar 29 2002 6:55 |
In this example, the queues are very unbalanced because queue 2 is approximately seven hours behind queue 1. This might indicate that there are some complex indexes in this queue. (Complex indexes involve multiple tags, subfields, and MARC maps for indexing.) From this result, you might decide to split queue two.
© 1998-2017 Sirsi Corporation