ZEROMOVE

ZeroMove hashing algorithm is an innovative novel data distribution technique for distributed systems. In contrast to the traditional consistent hashing algorithm, which is widely used in distributed data systems and requires data migration when scaling the system, ZeroMove hashing enables the addition of new clusters of nodes without moving data between nodes. A cluster is identified using an encoded unique identifier, while a node is found with a hash function within a cluster. This approach ensures that data remains in the node where it is hashed, thereby increasing availability and improving system performance. Furthermore, the ZeroMove hashing technique can significantly reduce facility and administrative expenses, making it an excellent option for large-scale distributed systems. Our tests on consistent hashing and ZeroMove hashing have shown that scaling from one node to six nodes with 480,000 data records took 6100 seconds in a system based on consistent hashing. In contrast,..