Nowadays, the structure of cloud uses the data processing of simple key value, which cannot adapted insearch of closeness effectively because of the lack of structures of effective indexes, and with the increase ofdimension, the structures of indexes similar to the tree existing could lead to the problem " of the curse ofdimension”. In this paper, we define a new cloud computing architecture in such global index, storagenodes is based on a Distributed Hash Table (DHT). In order to reduce the cost of calculation, storedifferent services on the hyperbolic tree by using virtual coordinates thus that greedy routing based onhyperbolic space properties in order to improve query storage and retrieving performance effectively. Next,we perform and evaluate our cloud computing indexing structure based on a hyperbolic tree using virtualcoordinates taken in the hyperbolic plane. We show through our experimental results that we compare withothers clouds systems to show our solution ensures consistence and scalability for Cloud platform.
展开▼
