Efficient Adaptive Data Compression Using Fano Binary Search Trees
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.
KeywordsCompression Ratio Internal Node Binary Search Tree Arithmetic Code Left Child
Unable to display preview. Download preview PDF.
- 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
- 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
- 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