ASSOSA UNIVERSITY

COLLEGE OF COMPUTING AND INFORMATICS

DEPARTMENT OF INFORMATION TECHNOLOGY

MSc Program in Information Technology

Literature Review Presentation
Course Title: Big Data

By Dejene Dagim
Replication-Based Query
Management for Resource
Allocation Using Hadoop and
MapReduce over Big Data

By Dejene Dagim
 Introduction
Overview of Replication-Based
1 Purpose of the Presentation 2 Query Management for Resource
Allocation Using Hadoop and MapReduce
over Big Data
The purpose of the The paper discusses the use of the MapReduce
presentation will be to model for creating a cluster parallel, distributed
provide an overview of the algorithm, and large datasets.
research conducted in this The paper focuses on evaluating this technique
area, including the for the efficient retrieval of large volumes of
challenges faced and the data.
solutions proposed. The technique allows for capabilities to inform a
massive database of information, from storage
and indexing techniques to the distribution of
queries, scalability, and performance in
heterogeneous environments
Background
1 What is Replication-Based Query
Management?
Is a technique used for efficient
retrieval of large volumes of data.
It allows for capabilities to inform
a massive database of information,
from storage and indexing
techniques to the distribution of
queries, scalability, and
performance in heterogeneous
environments.
2 Importance of Resource
Allocation in Big Data
Processing
Resource allocation is a crucial
aspect of big data processing. It
involves the distribution of
computing resources to various
tasks in a way that maximizes
overall efficiency and
throughput.

3 Introduction to Hadoop and MapReduce

MapReduce is a programming model and an associated
implementation for processing and generating big data sets
with a parallel, distributed algorithm on a cluster.
Replication-Based Query Management
Replication-Based Query Management
Approach
The Replication-Based Query
Management Approach is a technique
used for efficient retrieval of large
volumes of data. It allows for
capabilities to inform a massive database
of information, from storage and
indexing techniques to the distribution
of queries, scalability, and performance
in heterogeneous environments
Use Cases and Real-World Applications
One of the use cases of this approach
is resource allocation using Hadoop
and MapReduce over big data.
Load Balancing and Performance
Improvement
Replication allows distributing read
queries across multiple replicas,
reducing the load on the primary
database server.
 Hadoop and MapReduce for Resource Allocation
Overview of Hadoop and
MapReduce Framework
Hadoop is a software framework
that allows for the distributed
processing of large data sets
across clusters of computers
using simple programming
models
MapReduce is a programming
model that is used for processing
and generating large data sets on
clusters of computers
How Hadoop and MapReduce
Enable Resource Allocation
Distributed Storage and Processing:
(HDFS): Hadoop's file system,
HDFS, divides large datasets into
smaller blocks and distributes them
across multiple nodes in a cluster.
Parallel Processing:
MapReduce Model: MapReduce
breaks down large-scale data
processing tasks into smaller,
independent units called mappers
and reducers.
Key Features and
Advantages of Hadoop
Hadoop is a big data processing paradigm
that has multiple advantages Some of the
key features and advantages of Hadoop are:
Fault tolerance and high availability
 Scalability
 Easy to use
 Fast data processing due to distributed
processing
 Cost-effective
Implementation and Performance Considerations

1 Factors to Consider when Implementing Replication-Based Query

Management with Hadoop and MapReduce
Data Distribution and Replication: Query Optimization :MapReduce Job Design:
HDFS Block Size. Resource Management and Scheduling: YARN
Configuration:
Replication Factor
2 Performance Considerations and Best Practices
 Develop and test a backup and restore strategy
 Develop and test a backup and restore strategy
 Monitor the replication topology
3 Case Studies and Success Stories
The paper focuses on evaluating a technique for the efficient retrieval of large volumes of
data.
The technique allows for capabilities to inform a massive database of information, from
storage and indexing techniques to the distribution of queries, scalability, and
performance in heterogeneous environments.
The results show that the proposed work reduces the data processing time by 30%.
 Conclusion
1 Summary of Key Points 2 Future Possibilities and
Advancements
The paper proposes a replication-based query management
technique for resource allocation using Hadoop and Further research can focus on
MapReduce over big data. enhancing the replication-based query
It utilizes the MapReduce model and Hadoop's functionality management technique to handle more
to develop a parallel, distributed algorithm for handling large complex and diverse types of data,
datasets. such as unstructured or semi-
The technique focuses on efficient retrieval of large volumes structured data
of data, considering factors such as storage and indexing
techniques, query distribution, scalability, and performance in Investigating the integration of
heterogeneous environments. advanced clustering algorithms into
Results show a 30% reduction in data processing time, Hadoop's heterogeneous clusters can
indicating the effectiveness of the proposed technique in improve the performance of
optimizing resource allocation and improving efficiency in MapReduce job processing.
handling big data .
The technique also addresses node failures and reduces
delays through an improved rescheduling algorithm, ensuring
uninterrupted execution and minimizing resource wastage ..
Thank You!
Q&A