Skip to main content

TDSC: A Two-phase Duplicate String Compression Algorithm

  • Conference paper
Web Technologies and Applications (APWeb 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7234))

Included in the following conference series:

  • 1136 Accesses

Abstract

Due to current real-time data compression algorithms is not efficient enough, we have proposed a two-phase real-time data compression algorithm which can be very fast in data compression with high compression rate. The algorithm can adapt to both text and binary files. The first phase compresses the file with long common strings into short forms. The second phase compresses the result of the first phase with short bytes in common into the final results. We name the algorithm TDSC Algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bentley, J., McIlroy, D.: Data Compression Using Long Common Strings. In: Data Compression Conference, pp. 287–295. IEEE Press, New York (1999)

    Google Scholar 

  2. Karp, R.M., Rabin, M.O.: Efficient Randomized Pattern-matching Algorithms. IBM Journal of Research and Development 31(3), 249–260 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ziv, J., Lempel, A.: A Universal Algorithm for Sequential Data Compression. Information Theory 23(3), 337–343 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  4. Snappy - A fast compressor/decompressor, http://code.google.com/p/snappy

  5. Apache Hadoop, http://hadoop.apache.org

  6. Apache Pig, http://pig.apache.org

  7. Apache Hive, http://hive.apache.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, Z., You, J., Zhou, M. (2012). TDSC: A Two-phase Duplicate String Compression Algorithm. In: Wang, H., et al. Web Technologies and Applications. APWeb 2012. Lecture Notes in Computer Science, vol 7234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29426-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29426-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29425-9

  • Online ISBN: 978-3-642-29426-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics