Featured post

The Ultimate Cheat Sheet On Hadoop

Top 20 frequently asked questions to test your Hadoop knowledge given in the below Hadoop cheat sheet. Try finding your own answers and match the answers given here.




Question #1 

You have written a MapReduce job that will process 500 million input records and generate 500 million key-value pairs. The data is not uniformly distributed. Your MapReduce job will create a significant amount of intermediate data that it needs to transfer between mappers and reducers which is a potential bottleneck. A custom implementation of which of the following interfaces is most likely to reduce the amount of intermediate data transferred across the network?



A. Writable
B. WritableComparable
C. InputFormat
D. OutputFormat
E. Combiner
F. Partitioner
Ans: e




Question #2 

Where is Hive metastore stored by default ?


A. In HDFS
B. In client machine in the form of a flat file.
C. In client machine in a derby database
D. In lib directory of HADOOP_HOME, and requires HADOOP_CLASSPATH to be modified.
Ans: c




Question…

IBM PML Vs Google MapReduce why you need to read

IBM Parallel Machine Learning Toolbox (PML) is similar to that of Google's MapReduce programming model (Dean and Ghemawat, 2004) and the open source Hadoop system,which is to provide Application Programming Interfaces (APIs) that enable programmers who have no prior experience in parallel and distributed systems to nevertheless implement parallel algorithms with relative ease.
google mapreduce

Google MapReduce Vs IBM PML

  1. Like MapReduce and Hadoop, PML supports associative-commutative computations as its primary parallelization mechanism
  2. Unlike MapReduce and Hadoop, PML fundamentally assumes that learning algorithms can be iterative in nature, requiring multiple passes over data.
  3. The ability to maintain the state of each worker node between iterations, making it possible, for example, to partition and distribute data structures across workers
  4. Efficient distribution of data, including the ability of each worker to read a subset of the data, to sample the data, or to scan the entire dataset.
  5. Access to both sparse and dense datasetsParallel merge operations using tree structures for efficient collection of worker results on very large clusters.
  6. In order to make these extensions to the computational model and still address ease of use, PML provides an object-oriented API in which algorithms are objects that implement a predefined set of interface methods.

PML Unique Features

  • The PML infrastructure then uses these interface methods to distribute algorithm objects and their computations across multiple compute nodes-An object-oriented approach is employed to simplify the task of writing code to maintain, update, and distribute complex data structures in parallel environments.
  • Several parallel machine learning and data mining algorithms have already been implemented in PML, including Support Vector Machine (SVM) classifiers, linear regression, transform regression, nearest neighbors classifiers, decision tree classifiers, k-means, fuzzy k-means, kernel k-means, principal component analysis (PCA), kernel PCA, and frequent pattern mining.

Comments

Popular posts from this blog

AWS Vs Azure Load Balancers Top Insights

Hadoop File System Basic Commands

4 Important Skills You Need for Data Scientists

Hyperledger Fabric: 20 Real Interview Questions