A NEW MULTI-DIMENSIONAL HYPERBOLIC STRUCTURE FOR CLOUD SERVICE INDEXING

 


A NEW MULTI-DIMENSIONAL HYPERBOLIC STRUCTURE FOR CLOUD SERVICE INDEXING

Telesphore Tiendrebeogo1 and Oumarou Sié2

1Department of Mathematics and Computer Science, Polytechnic Univ ersity of Bobo-Dioulasso, Bobo-Dioulasso, Burkina Faso

2Department of Computer Science, University of Ouagadougou, Ouagadougou, Burkina Faso

ABSTRACT

Nowadays, the structure of cloud uses the data processing of simple key value, which cannot adapted in search of closeness effectively because of the lack of structures of effective indexes, and with the increase of dimension, the structures of indexes similar to the tree existing could lead to the problem " of the curse of dimension”. In this paper, we define a new cloud computing architecture in such global index, storage nodes is based on a Distributed Hash Table (DHT). In order to reduce the cost of calculation, store different services on the hyperbolic tree by using virtual coordinates thus that greedy routing based on hyperbolic 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 virtual coordinates taken in the hyperbolic plane. We show through our experimental results that we compare with others clouds systems to show our solution ensures consistence and scalability for Cloud platform.

KEYWORDS

Hyperbolic Geometry, Hyperbolic Tree, Data Indexing, Virus, Cloud Computing, Distributed Hash Table.

Full Text: https://aircconline.com/ijdms/V8N2/8216ijdms01.pdf

Volume Link: https://airccse.org/journal/ijdms/current2016.html

 

Comments

Popular posts from this blog

3rd International Conference on Computer Science, Engineering and Artificial Intelligence (CSEAI 2025)

A REVIEW OF THE USE OF R PPROGRAMMING FOR DATA SCIENCE RESEARCH IN BOTSWANA

HYBRID ENCRYPTION ALGORITHMS FOR MEDICAL DATA STORAGE SECURITY IN CLOUD DATABASE