Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/8416
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShegokar, P.
dc.contributor.authorThomas, M.V.
dc.contributor.authorChandrasekaran, K.
dc.date.accessioned2020-03-30T10:18:38Z-
dc.date.available2020-03-30T10:18:38Z-
dc.date.issued2015
dc.identifier.citation6th International Conference on Advances in Computing, Control, and Telecommunication Technologies, ACT 2015, 2015, Vol., , pp.330-343en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8416-
dc.description.abstractIn the era of Big Data, traditional databases face many problems to process data effectively. To solve problems we have NoSQL databases which can solve the problems and are becoming very popular. MongoDB is a document oriented NoSQL database which can process large data sets with the help of sharding mechanism. MongoDB supports range-based sharding, hash-based sharding and tag aware sharding. Problem with range-based method is that one of the shard will have more load. In case of hash-based method, we can distribute the load among shards but related data aren't together. Tag aware sharding method is better than the other two methods. But this method need to be enhanced as tagged data can belong to more shards and balancer have to migrate the data to most appropriate shard, hence we are enhancing the tag aware sharding in MongoDB. Improper distribution of data can't allow us to use all the benefits of sharding. Tag aware sharding is administrator based method in which tags are mentioned by the administrator. According to tags, data is migrated but we need to balance the load. To solve this problem, Weighted Round Robin (WRR) load balancing algorithm is used and it has improved the writing and querying performance.en_US
dc.titleLoad balancing of MongoDB with tag aware shardingen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.