Practical Implementations of Compressed RAM

Given a string S over an alphabet of size $\sigma$, we consider practical implementations of extended compressed RAM on S, which supports access, replace, lnsert, and delete operations on S while maintaining S in compressed form. In this paper, we proposed two implementations where each of them is based on the compressed RAM of Jansson et al. [ICALP 2012], and Grossi et al. [ICALP 2013], respectively. Experimental results show that our implementations support the operations efficiently while keeping the space proportional to the entropy of the input during the updates.