Space-efficient SLP encoding for $O(\log N)$-time random access

TL;DR

This paper introduces space-efficient encodings of SLPs that enable near-optimal $O(rac{ ext{log} N}{q-p})$ time random access to substrings, improving string compression and retrieval.

Contribution

It presents novel encoding schemes for SLPs that support fast random access with near-optimal space complexity, extending previous work on compressed string representations.

Findings

Supports substring extraction in $O( ext{log} N + q - p)$ time.

Uses space close to the information-theoretic lower bound.

Provides multiple encoding variants with different space-time trade-offs.

Abstract

A Straight-Line Program (SLP) $G$ for a string $T$ is a context-free grammar (CFG) that derives $T$ only, which can be considered as a compressed representation of $T$. In this paper, we show how to encode $G$ in $n \lceil \lg N \rceil + (n + n') \lceil \lg (n+\sigma) \rceil + 4n - 2n' + o(n)$ bits to support random access queries of extracting $T[p..q]$ in worst-case $O(\log N + q - p)$ time, where $N$ is the length of $T$, $\sigma$ is the alphabet size, $n$ is the number of variables in $G$ and $n' \le n$ is the number of symmetric centroid paths in the DAG representation for $G$. The time complexity is almost optimal because Verbin and Yu [CPM 2013] proved that $O(\log N)$ term cannot be significantly improved in general with $\mathrm{poly}(n)$-space data structures. We also present alternative encodings that achieve the same random access time with $n \lceil \lg N \rceil + n \lceil \lg (n+\sigma) \rceil + 5n + n' + o(n)$ or $n \lceil \lg N \rceil + n \lceil \lg (n+\sigma) \rceil + 5n - n' + \sigma + o(n+\sigma)$ bits of space.