Text collections of data need not only search support for identical objects, but approximate matching is even more important. A suitable metric for such a task is the edit distance measure. However, the quadratic complexity of the edit distance prevents from applying storage organizations such as the sequential search. We have investigated the properties of the D-index to approximate searching and matching of text databases.