The mathematical modeling of index documents publishing process provides a quantitative tool for the study of hit rate of index documents.

We are currently investigating whether using a customized B-Tree algorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.

The agent that updates the index database with new documents is currently rather slow and is not optimized, which can be fixed by adding a couple of tracking fields to the index documents.