Title :
Splaying for Compression: An Experimental Study
Author :
Antoniou, Dimitris ; Kampouris, Ioannis ; Theodoridis, Evangelos ; Tsakalidis, Athanasios
Author_Institution :
Comput. Eng. & Inf. Dept., Univ. of Patras, Patras, Greece
fDate :
Sept. 30 2011-Oct. 2 2011
Abstract :
In this paper, we propose novel randomized versions of the splay trees. We have evaluated the practical performance of these structures in comparison with the original version of splay trees and with their loglogn-competitive variations, in the application field of compression. In order to evaluate performance, we utilize plain splay trees, their loglog n-competitive variations, and our proposed randomized version with the Chain Splay technique to compress data. It is observed in practice, that the compression achieved in the case of the loglog n-competitive technique is, as intuitively expected, more efficient than the one of the plain splay trees.
Keywords :
data compression; chain splay technique; data compression; loglogn-competitive variation; splay trees; Binary search trees; Compression algorithms; DNA; Data compression; Heuristic algorithms; Image coding; Competitive Analysis; Compression; Data Structures; Randomized algorithms; Self-Adjustment; Splay Trees;
Conference_Titel :
Informatics (PCI), 2011 15th Panhellenic Conference on
Conference_Location :
Kastonia
Print_ISBN :
978-1-61284-962-1
DOI :
10.1109/PCI.2011.19