DOI 10.17586/0021-3454-2017-60-3-234-238
UDC 004.75
HORIZONTAL SCALING OF THE DATABASE USING CONSISTENT HASHING
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
References:
References:
- Wang W., Zhang Z. ACM SIGSOFT Software Engineering Notes, 2012, no. 37, pp. 4–5. DOI: 10.1145/2382756.2382772.
- Tamer Özsu M., Valduriez P. Principles of Distributed Database Systems, NY, Springer-Verlag, 2011, рp. 71–89.
- Chhanda R. Distributed Database Systems, New Jersey, USA, Pearson, 2009, рp. 119–133.
- Dynamo: Amazon’s Highly Available Key-value Store/ Amazon.com, Inc., 2007, рp. 208–212, http://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf.
- 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.
- 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.
- Swaminathan S. Proc. of the ACM SIGMOD Intern. Conf. on Management of Data, USA, ACM, 2012, рp. 208–210. DOI: 10.1145/2213836.2213945.
- Aspnes J., Safra M., Yin Y. Proc. of the 19th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA '08, 2008, рp. 1066–1075.
- 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.
