An Efficient Search Algorithm for REIK Overlay Network

We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of settings. In this paper we have presented an efficient similarity search for REIK network called SSREIK which is a novel framework that dynamically structure, in order to build distributed routing information. It allows the evaluation of range and nearest neighbor queries in a distributed manner and utilizes a set of distributed statistics and guarantees that all similar objects to the query are retrieved.