The algorithm is simple; it iterates through the top-level items of the tree and compares their text contents with the search string (lines 43 to 52 in listing 6).
We are currently investigating whether using a customized B-Treealgorithm can make it possible to search with the help of wild CARDS and to store index documents more compactly.