An Experimental Implementation of Map Reduce on the Hadoop for Analyzing Big Data | Chapter 7 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

The Speedy development of Internet has led to huge quantities of digital data available online and vast capacity

of digital data is increasing and successfully stored. In demand to the process, analyzed, and linked huge volume

of stored data to achieve correct Information, some computation is required. Even efficient processing and

implementation is needed for scientific data performance analysis. The already existing MapReduce Technique

had been compared with Hadoop to afford high performance and efficiency for large volume of dataset. Hadoop

distributed architecture with MapReduce programming is analysis here.

Author (s) Details

Gul Shaira Banu Jahangeer

Department of Computer Science and Engineering, Kalasalingam Academy of Research and Education, India, Srivilliputhur, Tamil Nadu, India.

T. Dhiliphan Rajkumar

Faculty of Computer Science and Engineering, Kalasalingam Academy of Research and Education, Tamilnadu, India.

View Book :- https://bp.bookpi.org/index.php/bpi/catalog/book/237

Higher Power Growth of Polynomials with Prescribed Zeros | Chapter 6 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

Let p(z) be a polynomial of degree n having all its zeros on |z| = k, k ≤ 1. In this paper, we

generalize a result proved by Dewan and Ahuja [J. Math. Ineq., 2011,5(3): 355-361.] which further

has interesting implications. 

 

Author (s) Details

Barchand Chanam

Department of Mathematics, National Institute of Technology, Manipur, India.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237

An Experimental Approach to Improve the Performance of FCFS Disk Scheduling Algorithm | Chapter 5 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

One of the functions of the Operating System is serve the pending I/O requests from disk queue to the

requesting processes. Once a request is served, the operating system has to determine which request will be

served next. This process involves a careful examination of pending requests to determine the most efficient

way to service the requests. The aim of most of the disk scheduling algorithms is to reduce seek times for a set

of pending I/O requests. Some of the important disk scheduling algorithms are First-Come-First-Served (FCFS),

Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. Out of these disk scheduling

algorithms, the simplest and fair is the FCFS which serves the I/O requests based on their arrival. FCFS is

simple and easy to implement but usually it does not provide the efficient service. Here, I am proposing an

approach which can improve the performance of FCFS and reduce the seek time. This approach can be called

Improved First-Come-First-Served (IFCFS). After applying the suggested improvement, it has been found that

the service is fast and seek time has been reduced drastically. This has been proved with the experimental results with some sets of pending I/O requests.

 

Author (s) Details

Manish Kumar Mishra
Department of Computer Science, University of Gondar, Ethiopia.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237

Extensions of Bernstein Type Inequalities of a Polynomial to Polar Derivative | Chapter 4 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

Let p (z) be a polynomial of degree n and a be any real or complex number, the polar derivative of p(z) ,

denoted by D p(z) a , is defined as

Da p(z) = np(z)+ (a - z)p¢(z).

In this Chapter, we discuss the simple and short proofs of the Bernstein type inequalities on polar derivative of a

polynomial obtained by Dewan and Singh [J. of Combinatorics, Information & System Sciences, 31(2006)(1-4),

317-324.] compared to related existing results and further worthy implications of the techniques involved.

Author (s) Details

Barchand Chanam

Department of Mathematics, National Institute of Technology, Manipur, India.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237

Selection of Table Scan or Seek Scan on the Basis of Data Size to Reduce Number of Logical Reads | Chapter 3 | Theory and Practice of Mathematics and Computer Science Vol. 1

The information retrieval system is an effort to extract services from a range of knowledge services, which are

specific to the information requirement. You will access this method using passwords or keywords or a user

query. Databases and documents are usually limited to different organizational framework managed by the

DBMS and the Information Retrieval Systems (IRS). Both DBMS and IRS, though, frequently store data on the

same individuals, providing convergence opportunities. In the modern world, it has become necessary to retrieve

the information in very efficient manner and within a very less time. But being availability of data in very large

size, information retrieval form database become slower which may affect the overall performance of the

system. For this, various methodologies have been implemented in all DBMS software. In addition, it becomes

mandatory to use proper technique for the better and faster result. Table scan and seek scan have integrated in

the DBMS for the same purpose. In the current research, we have compared both methods for better

performance [1].

Author (s) Details

S. K. Kharade

Department of Mathematics, Shivaji University, Kolhapur, India.

K. G. Kharade

Department of Computer Science, Shivaji University, Kolhapur, India.

V. S. Kumbhar

Department of Computer Science, Shivaji University, Kolhapur, India.

R. K. Kamat

Department of Electronics, Shivaji University, Kolhapur, India.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237 

Evaluation of Arithmetic Searches over String Searches for Better Performance | Chapter 2 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

Most Data Base Administrators (DBA) prefers one form of data over another as their own advantages and

disadvantages. It is often easy to determine, but at times it is a little tougher to determine. We should address

these circumstances in today's blog article. The most important quality requirements for data in a database

involve the form and duration of data. DB2 automatically guarantees that only the right form of data is stored in

that column by clearly defining the data form of each column when a table is formed. A process is rejected

which attempts to insert or change the data to an incompatible meaning. In fact, the column is given a fixed

duration to avoid the accumulation of larger values in the table [1].

Author (s) Details

S. K. Kharade

Department of Mathematics, Shivaji University, Kolhapur, India.

K. G. Kharade

Department of Computer Science, Shivaji University, Kolhapur, India.

V. S. Kumbhar

Department of Computer Science, Shivaji University, Kolhapur, India.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237

Estimation of a Parameter of Certain Bivariate Distributions with Equal Coecients of Variation by Concomitants of Record Values | Chapter 1 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

In this work, we deals with the estimation of a parameter of some bivariate distributions with equal

coe_cients of variation by concomitants of record values.We consider the problem of estimation of

the parameter _2 involved in Bivariate Normal distribution(BVND), Morgenstern type bivariate

logistic distribution(MTBLD) and Morgenstern type bivariate exponential distribution(MTBED)

with equal coe_cients of variation by concomitants of upper record values.

Author (s) Details

N. K. Sajeevkumar

Department of Statistics, Government College Kariavattom, Thiruvananthapuram-695581, India.

View Book :- https://bp.bookpi.org/index.php/bpi/catalog/book/237