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

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.

4 Figures and Tables

Cite this paper

@inproceedings{Patel2014PerformanceIO, title={Performance improvement of sharding in MongoDB using k-mean clustering algorithm}, author={M. P. Patel and D. Vasava}, year={2014} }