2018
DOI: 10.3837/tiis.2018.06.018
|View full text |Cite
|
Sign up to set email alerts
|

An Optimized Iterative Semantic Compression Algorithm And Parallel Processing for Large Scale Data

Abstract: With the continuous growth of data size and the use of compression technology, data reduction has great research value and practical significance. Aiming at the shortcomings of the existing semantic compression algorithm, this paper is based on the analysis of ItCompress algorithm, and designs a method of bidirectional order selection based on interval partitioning, which named An Optimized Iterative Semantic Compression Algorithm (Optimized ItCompress Algorithm). In order to further improve the speed of the a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 32 publications
(62 reference statements)
0
1
0
Order By: Relevance
“…Apache Spark is an efficient and stretchable clustering computing system, which inherits MapReduce's linear scalability and fault tolerance on the Hadoop platform. However, Spark extends the MapReduce model in many ways and utilizes the RDD model for computing large-scale data in parallel [26]. The RDD model is the core component of Spark.…”
Section: The Spark Cloud Platformmentioning
confidence: 99%
“…Apache Spark is an efficient and stretchable clustering computing system, which inherits MapReduce's linear scalability and fault tolerance on the Hadoop platform. However, Spark extends the MapReduce model in many ways and utilizes the RDD model for computing large-scale data in parallel [26]. The RDD model is the core component of Spark.…”
Section: The Spark Cloud Platformmentioning
confidence: 99%