Clustering and presorting for parallel burrows wheeler-based compression  

作　　者：Sergey Voronin Eugene Borovikov Raqibul Hasan 

机构地区：[1]Intelligent Automation,Inc.Rockville,MD,USA

出　　处：《International Journal of Modeling, Simulation, and Scientific Computing》2021年第6期75-88,共14页建模、仿真和科学计算国际期刊（英文）

摘　　要：We describe practical improvements for parallel BWT-based lossless compressors frequently utilized in modern day big data applications.We propose a clustering-based data permutation approach for improving compression ratio for data with significant alphabet variation along with a faster string sorting approach based on the application of the O(n)complexity counting sort with permutation reindexing.

关 键 词：Lossless data compression Burrows–Wheeler transform data permutation fast string sorting 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]