Experimenting with Complex Deferred Indexing

Complex deferred indexing is difficult because there is no single established solution. You must experiment to discover the best solution for your library, including the number of queues necessary and which indexes to assign to additional queues. (For example, you can experiment by placing a small group of indexes into the additional queue to have them indexed more quickly. You might also try placing the most time-consuming indexes in the additional queue so you have equally balanced queues.)

You can perform queries to learn important information about a queue. From this information, you can decide which indexes to place in the new queue when you split your existing queue. (For example, you can perform a query to tell you how long the oldest entry has been waiting in the queue. Another useful query is one that tells you how many entries are in a queue.)

This section explains these topics:

 


© 1998-2017 Sirsi Corporation