Text collections of data need not only search support for
identical objects, but the approximate matching is even more
important. A suitable metric to such task is the edit distance
measure. However, its quadratic computational complexity prevents
from applying naive storage organizations, such as the sequential
search, and more sophisticated search structures must be used. We
have investigated the properties of the D-index to approximate
searching in text databases. The experiments confirm very good
performance for retrieving close objects and sub-linear
scalability to process large files.