Data arrangement and dimensional compression using Vivaldi for similarity search on structured peer-to-peer network

Peer-to-peer system is a promising solution to manage a large amount of data, but similarity search on peer-to-peer network with a restricted small number of messages is a challenging problem. Existing methods that can perform similarity search work only with low-dimensional data. We propose a method to transform the very high-dimensional data into low-dimensional vectors in order to perform similarity search.