2017
DOI: 10.1007/978-981-10-3773-3_3
|View full text |Cite
|
Sign up to set email alerts
|

Grouping-Aware Data Placement in HDFS for Data-Intensive Applications Based on Graph Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…It is therefore a promising idea to gather these files in the same node or in close nodes, thus minimizing the number of remote accesses which can harm the performance of the system. The knowledge about data correlation can be extracted from historical data using several methods such as machine learning, data mining, 3,16,17 graph theory, 18‐20 statistics, and so on. In this respect, discovering knowledge out of huge volumes of data can be performed more efficiently, based on the high‐performance computing of cloud 21 .…”
Section: Introductionmentioning
confidence: 99%
“…It is therefore a promising idea to gather these files in the same node or in close nodes, thus minimizing the number of remote accesses which can harm the performance of the system. The knowledge about data correlation can be extracted from historical data using several methods such as machine learning, data mining, 3,16,17 graph theory, 18‐20 statistics, and so on. In this respect, discovering knowledge out of huge volumes of data can be performed more efficiently, based on the high‐performance computing of cloud 21 .…”
Section: Introductionmentioning
confidence: 99%