2019
DOI: 10.1186/s40537-019-0269-1
|View full text |Cite
|
Sign up to set email alerts
|

On using MapReduce to scale algorithms for Big Data analytics: a case study

Abstract: Scale adds cost. It also adds complexity and can make even the simplest computing infeasible. Many data analytics algorithms are originally designed for in-memory data. When facing with huge volume of data, these algorithms fail to scale due to limitation of processing capacity, storage capacity and operations on a single machine. Thus, to improve scalability and efficiency, parallel and distributed algorithms are developed to

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 35 publications
(50 reference statements)
0
2
0
Order By: Relevance
“…As discussed in [58], PrefixSpan outperforms other Aprori-like algorithms and can be extended to mining sequential patterns with user-specified constraints for various domain applications. In [59], Kijsanayothin et al stated that MapReduce is a programming paradigm that enables parallel and distributed execution of massive data processing on { "RULES": [ { "LHS": ["(A)", "(D)"], "RHS": ["(C)"], "sup": 0.55, "conf": 0.75 }, { "LHS": ["(B,C)", "(A,C,E)", "(D)"], "RHS": ["(A,E)"], "sup": 0.60, "conf": 0.9 }, … ] } large clusters of machines, and thus researchers can focus on building efficient algorithms to enhance performance.…”
Section: B Algorithmsmentioning
confidence: 99%
“…As discussed in [58], PrefixSpan outperforms other Aprori-like algorithms and can be extended to mining sequential patterns with user-specified constraints for various domain applications. In [59], Kijsanayothin et al stated that MapReduce is a programming paradigm that enables parallel and distributed execution of massive data processing on { "RULES": [ { "LHS": ["(A)", "(D)"], "RHS": ["(C)"], "sup": 0.55, "conf": 0.75 }, { "LHS": ["(B,C)", "(A,C,E)", "(D)"], "RHS": ["(A,E)"], "sup": 0.60, "conf": 0.9 }, … ] } large clusters of machines, and thus researchers can focus on building efficient algorithms to enhance performance.…”
Section: B Algorithmsmentioning
confidence: 99%
“…The MapReduce [6] programming paradigm is one of the most representative BDA. MapReduce provides horizontal scaling to petabytes of data on thousands of compute nodes, a simplified programming model, and a high degree of reliability when failed nodes occur [7]. In MapReduce, the input data are divided into many parts.…”
Section: Introductionmentioning
confidence: 99%
“…Google(Kijsanayothin et al, 2019). It is mainly developed and implemented using a functional programming model.…”
mentioning
confidence: 99%