Skip to main content
SpringerLink
Log in

Efficient Adaptive Data Compression Using Fano Binary Search Trees

  • Conference paper
Computer and Information Sciences - ISCIS 2005 (ISCIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3733))

Included in the following conference series:

Abstract

In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can be maintained adaptively and in a self-organizing manner by using new tree-based operators, namely the Shift-To-Left (STL) and the Shift-To-Right (STR) operators. The encoding and decoding procedures that also update the FBST have been implemented, and show that the adaptive Fano coding using FBSTs, the Huffman, and the greedy adaptive Fano coding achieve similar compression ratios.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ahlswede, R., Han, T.S., Kobayashi, K.: Universal Coding of Integers and Unbounded Search Trees. IEEE Trans. on Information Theory 43(2), 669–682 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Albers, S., Mitzenmacher, M.: Average case analyses of list update algorithms, with applications to data compression. Algorithmica 21, 312–329 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Albers, S., Westbrook, J.: Self-organizing data structures. In: Fiat, A., Woeginger, G. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 13–51. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Allen, B., Munro, I.: Self-organizining Binary Search Trees. J. Assoc. Comput. Mach. 25, 526–535 (1978)

    MATH  MathSciNet  Google Scholar 

  5. Aragon, C., Seidel, R.: Randomized Search Trees. In: Proceedings 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 540–545 (1989)

    Google Scholar 

  6. Bent, S., Sleator, D., Tarjan, R.: Biased Search Trees. SIAM Journal of Computing 14, 545–568 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bitner, J.: Heuristics that Dynamically Organize Data Structures. SIAM Journal of Computing 8, 82–110 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cheetham, R., Oommen, B.J., Ng, D.: Adaptive Structuring of Binary Search Trees Using Conditional Rotations. IEEE Transactions on Knowledge and Data Engineering 5(4), 695–704 (1993)

    Article  Google Scholar 

  9. Deorowicz, S.: Second step algorithms in the burrows-wheeler compression algorithm. Software - Practice and Experience 32(2), 99–111 (2002)

    Article  MATH  Google Scholar 

  10. Hankerson, D., Harris, G., Johnson Jr, P.: Introduction to Information Theory and Data Compression. CRC Press, Boca Raton (1998)

    MATH  Google Scholar 

  11. Iacono, J.: Alternatives to splay trees with o(log n) worst-case access times. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 516–522 (2001)

    Google Scholar 

  12. Lai, T., Wood, D.: Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost. SIAM Journal of Computing 27(6), 1564–1591 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mehlhorn, K.: Dynamic Binary Search. SIAM Journal of Computing 8, 175–198 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  14. Oommen, B.J., Zgierski, J.: A Learning Automaton Solution to Breaking Substitution Ciphers. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI 15, 185–192 (1993)

    Article  Google Scholar 

  15. Rueda, L.: Advances in Data Compression and Pattern Recognition. PhD thesis, School of Computer Science, Carleton University, Ottawa, Canada (April 2002), Electronically available at, http://www.cs.uwindsor.ca/~lrueda/papers/PhdThesis.pdf

  16. Sherk, M.: Self-adjusting k-ary Search Trees and Self-adjusting Balanced Search Trees. Technical Report 234/90, University of Toronto, Toronto, Canada (February 1990)

    Google Scholar 

  17. Vitter, J.: Design and Analysis of Dynamic Huffman Codes. Journal of the ACM 34(4), 825–845 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Williams, H., Zobel, J., Heinz, S.: Self-adjusting trees in practice for large text collections. Software - Practice and Experience 31(10), 925–939 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Windsor, 401 Sunset Ave., Windsor, ON, N9B 3P4, Canada

    Luis Rueda

  2. School of Computer Science, Carleton University, 1125 Colonel By Dr., Ottawa, ON, K1S 5B6, Canada

    B. John Oommen

Authors
  1. Luis Rueda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. John Oommen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Engineering, Boğaziçi University, 34342, Bebek, Istanbul, Turkey

    pInar Yolum  & Can Özturan  & 

  2. Computer Engineering Department, Boğaziçi University, 34342, Bebek, İstanbul, Turkey

    Tunga Güngör

  3. Computer Engineering Department, Bogazici University, 80815, Bebek, Istanbul, Turkey

    Fikret Gürgen

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rueda, L., Oommen, B.J. (2005). Efficient Adaptive Data Compression Using Fano Binary Search Trees. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_79

Download citation

  • DOI: https://doi.org/10.1007/11569596_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29414-6

  • Online ISBN: 978-3-540-32085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation