sentences:  In high-dimensional spaces, tree indexing structures become useless because an increasing percentage of the nodes need to be examined anyway.To speed up linear search, a compressed version of the feature vectors stored in RAM is used to prefilter the datasets in a first run.The final candidates are determined in a second stage using the uncompressed data from the disk for distance calculation.