Content-Aware Partial Compression for Textual Big Data Analysis in Hadoop
- 29 June 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 4 (4) , 459-472
Abstract
A substantial amount of information in companies and on the Internet is present in the form of text. The value of this semi-structured and unstructured data has been widely acknowledged, with consequent scientific and commercial exploitation. The ever-increasing data production, however, pushes data analytic platforms to their limit. Compression as an effective means to reduce data size has been employed by many emerging data analytic platforms, whom the main purpose of data compression is to save storage space and reduce data transmission cost over the network. Since general purpose compression methods endeavour to achieve higher compression ratios by leveraging data transformation techniques and contextual data, this context-dependency forces the access to the compressed data to be sequential. Processing such compressed data in parallel, such as desirable in a distributed environment, is extremely challenging. This work proposes techniques for more efficient textual big data analysis with an emphasis on content-aware compression schemes suitable for the Hadoop analytic platform. The compression schemes have been evaluated for a number of standard MapReduce analysis tasks using a collection of public and private real-world datasets. In comparison with existing solutions, they have shown substantial improvement in performance and significant reduction in system resource requirements.Keywords
This publication has 28 references indexed in Scilit:
- Twitter analyticsACM SIGKDD Explorations Newsletter, 2014
- Towards zero-overhead static and adaptive indexing in HadoopThe VLDB Journal, 2013
- Fast candidate generation for real-time tweet search with bloom filter chainsACM Transactions on Information Systems, 2013
- Column-oriented storage techniques for MapReduceProceedings of the VLDB Endowment, 2011
- Hadoop++Proceedings of the VLDB Endowment, 2010
- The performance of MapReduceProceedings of the VLDB Endowment, 2010
- Classification of DNA sequences using Bloom filtersBioinformatics, 2010
- MapReduceCommunications of the ACM, 2008
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970