Open Access Open Access  Restricted Access Subscription Access

Structured Parallel Efficient Execution Database Management System Over Enormous Dataset with MapReduce using Matlab


Affiliations
1 Department of CSE, AKNU University, GIET Engineering College, Rajamahendravaram – 533296, Andhra Pradesh, India
2 Department of CSE, University College of Engineering, Adikavi Nannaya University, Rajamahendravaram – 533296, Andhra Pradesh, India
 

Objective: MapReduce is an encoding representation and a connected execution for handing out and generate huge data set. The objective of the present paper is that retrieve the data from enormous dataset in efficient manner a MapReduce. Methodology: The present paper uses structured parallel efficient execution Database Management System i.e. Parallel Database Management Systems (PDBMS). The present paper uses the Matlab for implementing PDBMS. This paper uses the broad concept of the paradigms quite than the exact implementations of MapReduce and Parallel DBMS. Such enormous information investigation on large clusters present new opportunity and challenge for mounting an extremely scalable and competent dispersed calculation system which is informal to strategy and multi- composite scheme optimization to exploit presentation and dependability to conquer this problem realize a new algorithm called Structured Parallel Efficient Execution Database 'Management (SPEED'MS) System' over Enormous Dataset with MapReduce. Findings: An optimizer is answerable for converting script into well-organized implementation plans for the dispersed calculation engine. Speed is living thing utilized day by day for assorted qualities of data study and data mining applications driving Bing, and other online services. The algorithm has been tested with the Matlab. Applications: MapReduce concept has potential applications like Clinical big data analysis, Bioinformatics Distributed programming.

Keywords

DBMS, Enormous Dataset Speed, MapReduce, Parallel DBMS.
User

Abstract Views: 196

PDF Views: 0




  • Structured Parallel Efficient Execution Database Management System Over Enormous Dataset with MapReduce using Matlab

Abstract Views: 196  |  PDF Views: 0

Authors

Uma Mahesh Kumar Gandham
Department of CSE, AKNU University, GIET Engineering College, Rajamahendravaram – 533296, Andhra Pradesh, India
P. Suresh Varma
Department of CSE, University College of Engineering, Adikavi Nannaya University, Rajamahendravaram – 533296, Andhra Pradesh, India

Abstract


Objective: MapReduce is an encoding representation and a connected execution for handing out and generate huge data set. The objective of the present paper is that retrieve the data from enormous dataset in efficient manner a MapReduce. Methodology: The present paper uses structured parallel efficient execution Database Management System i.e. Parallel Database Management Systems (PDBMS). The present paper uses the Matlab for implementing PDBMS. This paper uses the broad concept of the paradigms quite than the exact implementations of MapReduce and Parallel DBMS. Such enormous information investigation on large clusters present new opportunity and challenge for mounting an extremely scalable and competent dispersed calculation system which is informal to strategy and multi- composite scheme optimization to exploit presentation and dependability to conquer this problem realize a new algorithm called Structured Parallel Efficient Execution Database 'Management (SPEED'MS) System' over Enormous Dataset with MapReduce. Findings: An optimizer is answerable for converting script into well-organized implementation plans for the dispersed calculation engine. Speed is living thing utilized day by day for assorted qualities of data study and data mining applications driving Bing, and other online services. The algorithm has been tested with the Matlab. Applications: MapReduce concept has potential applications like Clinical big data analysis, Bioinformatics Distributed programming.

Keywords


DBMS, Enormous Dataset Speed, MapReduce, Parallel DBMS.



DOI: https://doi.org/10.17485/ijst%2F2017%2Fv10i20%2F156989