MapReduce Performance in MongoDB Sharded Collections
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 6
Abstract
In the modern era of computing and countless of online services that gather and serve huge data around the world, processing and analyzing Big Data has rapidly developed into an area of its own. In this paper, we focus on the MapReduce programming model and associated implementation for processing and analyzing large datasets in a NoSQL database such as MongoDB. Furthermore, we analyze the performance of MapReduce in sharded collections with huge dataset and we measure how the execution time scales when the number of shards increases. As a result, we try to explain when MapReduce is an appropriate processing technique in MongoDB and also to give some measures and alternatives to take when MapReduce is used.
Authors and Affiliations
Jaumin Ajdari, Brilant Kasami
Keywords
Related Articles
- EP ID EP320052
- DOI 10.14569/IJACSA.2018.090617
- Views 82
- Downloads 0
On the Parallel Design and Analysis for 3-D ADI Telegraph Problem with MPI
In this paper we describe the 3-D Telegraph Equation (3-DTEL) with the use of Alternating Direction Implicit (ADI) method on Geranium Cadcam Cluster (GCC) with Message Passing Interface (MPI) parallel software. The algor...
Design and Application of a Smart Diagnostic System for Parkinson’s Patients using Machine Learning
For analysis of Parkinson illness gait disabilities de-tection is essential. The only motivation behind this examination is to equitably and consequently differentiate among sound subjects and the one who is forbearing t...
Communication-Load Impact on the Performance of Processor Allocation Strategies in 2-D Mesh Multicomputer Systems
A number of processor allocation strategies have been proposed in literature. A key performance factor that can highlight the difference between these strategies is the amount of communication conducted between the paral...
Enhanced Textual Password Scheme for Better Security and Memorability
Traditional textual password scheme provides a large number of password combinations but users generally use a small portion of available password space. Complex textual passwords are difficult to remember, therefore mos...
Efficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom based on Three Levels DWT-PCA
The main weakness of the k-Nearest Neighbor algorithm in face recognition is calculating the distance and sort all training data on each prediction which can be slow if there are a large number of training instances. Thi...