word2vec -storing a word and its vector yet be able to efficiently run k-nearest neighbour
A most popular way of obtaining the approximate nearest neighbors is the locality sensitive hash. And here are some practical results. Then once you have the neighboring keys, it's straightforward to use a key-value store to retrieve the corresponding words.