Tree indexing for efficient search of similar documents

Linear algebra-based techniques have long been used to correlate similar documents. They map the documents to a multidimensional vector space, in which each document is represented by a vector. Searching related documents then translates into searching nearest neighbors in the vector space. We propose an indexing structure, called cosine R-tree, which indexes multidimensional vector space and provides efficient nearest neighbor search. Our preliminary results show that it gives better performance than a brute-force linear scan strategy