2011 15th Panhellenic Conference on Informatics (2011)
Sept. 30, 2011 to Oct. 2, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCI.2011.19
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.
Data Structures, Self-Adjustment, Competitive Analysis, Splay Trees, Randomized algorithms, Compression
D. Antoniou, A. Tsakalidis, I. Kampouris and E. Theodoridis, "Splaying for Compression: An Experimental Study," 2011 15th Panhellenic Conference on Informatics(PCI), Kastoria, Greece, 2011, pp. 90-94.