ISSN 0021-3454 (print version)
ISSN 2500-0381 (online version)

vol 65 / June, 2022

DOI 10.17586/0021-3454-2017-60-3-234-238

UDC 004.75


A. S. Zernov
ITMO University; Department of Computer Science; Student

A. A. Ozhiganov
ITMO University, Department of Computation Technologies; Professor

Read the full article 

Abstract. The problem of the organization of distributed storage of large amounts of data in large-scale cluster systems is considered. A method of data distribution across cluster nodes using consistent hashing is presented. The basic method of consistent hashing, as well an improved method using virtual nodes are described.
Keywords: distributed storages, database scalability, datasets, sharding, high-loaded systems

  1. Wang W., Zhang Z. ACM SIGSOFT Software Engineering Notes, 2012, no. 37, pp. 4–5. DOI: 10.1145/2382756.2382772.
  2. Tamer Özsu M., Valduriez P. Principles of Distributed Database Systems, NY, Springer-Verlag, 2011, рp. 71–89.
  3. Chhanda R. Distributed Database Systems, New Jersey, USA, Pearson, 2009, рp. 119–133.
  4. Dynamo: Amazon’s Highly Available Key-value Store/, Inc., 2007, рp. 208–212,
  5. Fan L., Cao P., Almeida J., Broder A.Z. Summary Cache: a Scalable Wide-Area Web Cache Sharing Protocol, Computer Science Department, Univ. of Wisconsin, Madison, USA, 1998, рp. 287–292.
  6. Karger, Lehman E., Leighton T., Levine M., Lewin D., Panigrahy R. Proc. of the 29th Annual ACM Symp. on Theory of Computing, 1997, рp. 11–15.
  7. Swaminathan S. Proc. of the ACM SIGMOD Intern. Conf. on Management of Data, USA, ACM, 2012, рp. 208–210. DOI: 10.1145/2213836.2213945.
  8. Aspnes J., Safra M., Yin Y. Proc. of the 19th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA '08, 2008, рp. 1066–1075.
  9. Haiying S., Cheng-Zhong Xu. Proc. of the 20th Intern. Conf. on Parallel and Distributed Processing, USA, IEEE Computer Society, Washington, 2006, рp. 39–40.