LH*TH: New fast Scalable Distributed Data Structures (SDDSs)
Proposed in 1993 the Scalable Distributed Data Structures (SDDSs) became a profile of basis for the data management on Multi computer. In this paper we propose an organization of a LH* bucket based on the trie hashing in order to improve times of different access request
Keywords: Distributed hashing, SDDS, multi computers, distributed system, access method
Download Full-Text
ABOUT THE AUTHOR
Aridj Mohamed
an Associate Professor at the Computer Science Department of Chlef University , Algeria. His current research area includes, distributed systems, Scalable Distributed Data Structures, multi computers . He received his Doctorat degree in distributed systems from école supérieur d’informatique Oued Smar , Algeria
Aridj Mohamed
an Associate Professor at the Computer Science Department of Chlef University , Algeria. His current research area includes, distributed systems, Scalable Distributed Data Structures, multi computers . He received his Doctorat degree in distributed systems from école supérieur d’informatique Oued Smar , Algeria
