 Following this line of research, we present the first compressed index on RLBWT, which we callr-index-f , that supports various queries including locate, count, extract queries, decompression and prefix search in the optimal time with smaller working space of O(r) words for small alphabets in this paper. We present efficient data structures for computing two important functions of LF and \phi^{-1} in constant time with O(r) words of space , which is a bit step forward in computation time from the previous best result of O(\log \log n)time for string length n and O(r) words of space.
<clarity>  Following this line of research, we present the first compressed index on RLBWT, which we callr-index-f , that supports various queries including locate, count, extract queries, decompression and prefix search in the optimal time with smaller working space of O(r) words for small alphabets in this paper. We present efficient data structures for computing two important functions of LF and \phi^{-1} in constant time with O(r) words of space , which is a bit step forward in computation time from the previous best result of O(\log \log n)time for string length n and O(r) words of space.
 Following this line of research, we present the first compressed index on RLBWT, which we callr-index-f RLBWT. In this paper, we improve LF and \phi^{-1} in constant time with O(r) words of space , which is a bit step forward in computation time from the previous best result of O(\log \log n)time for string length n and O(r) words of space.