The application of information retrieval techniques in interactive environments requires systems capable of efficiently processing vague queries. To reach reasonable response times, new data structures and algorithms have to be developed. In this paper we describe an approach taking advantage of the conditions of interactive usage and special access paths. To have a reference we investigate text queries and compared our algorithms to the well known “Buckley/Lewit” algorithm. We achieved significant improvements for the response times.