Performance improvement of sharding in MongoDB using k-mean clustering algorithm

Authors

  • Mrugesh P Patel Department Of Computer Engineering,Birla VishvakarmaMahavidyalaya,VallabhVidyanagar, India mrugesh56739@gmail.com
  • Mosin I. Hasan Department Of Computer Engineering,Birla VishvakarmaMahavidyalaya,VallabhVidyanagar, India mihasan@bvmengineering.ac.in
  • Hemant D. Vasava Department Of Computer Engineering,Birla VishvakarmaMahavidyalaya,VallabhVidyanagar, India hdvasava@bvmengineering.ac.in

Keywords:

MongoDB, issues, Auto-sharding, K-Mean clustering algorithm, balancing strategy

Abstract

Web applications are growing at a staggering rate every day. As web applications keep getting
more complex, their data storage requirements tend to grow exponentially.No-SQL (MongoDB) database
which breaks theshackles of RDBMS is becoming the focus of attention.In thispaper, firstly represented
the architecture and implementation process of Auto-Sharding process in MongoDB database, then
animprovedalgorithm based on K-Mean clustering operation isproposed in order to solve the problem of
uneven distribution ofdata in auto-sharding.so using this balancing strategy we caneffectively balance the
data among shards and improve thecluster‟s concurrent reading and writing performance.

Downloads

Published

2014-05-25

How to Cite

Mrugesh P Patel, Mosin I. Hasan, & Hemant D. Vasava. (2014). Performance improvement of sharding in MongoDB using k-mean clustering algorithm. International Journal of Advance Engineering and Research Development (IJAERD), 1(5), 415–419`. Retrieved from https://ijaerd.org/index.php/IJAERD/article/view/88

Issue

Vol. 1 No. 5 (2014): Volume 1 Issue 5 (May-2014)

Section

Articles