• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

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 algorithm, we propose a parallel optimization iterative semantic compression algorithm using GPU (POICAG) and an optimized iterative semantic compression algorithm using Spark (DOICAS). A lot of valid experiments are carried out on four kinds of datasets, which fully verified the efficiency of the proposed algorithm.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Ran Jin, Gang Chen, Anthony K. H. Tung, Lidan Shou and Beng Chin Ooi, "An Optimized Iterative Semantic Compression Algorithm And Parallel Processing for Large Scale Data," KSII Transactions on Internet and Information Systems, vol. 12, no. 6, pp. 2761-2781, 2018. DOI: 10.3837/tiis.2018.06.018

[ACM Style]
Jin, R., Chen, G., Tung, A. K. H., Shou, L., and Ooi, B. C. 2018. An Optimized Iterative Semantic Compression Algorithm And Parallel Processing for Large Scale Data. KSII Transactions on Internet and Information Systems, 12, 6, (2018), 2761-2781. DOI: 10.3837/tiis.2018.06.018