The transition probability matrix to building sequence database of forward and backward Markov one-step state is introduced. Using pseudo projection combined with bi-level projection algorithm instead of level-by-level projection, it can improve classical sequence mining algorithms that usually have much time and space complexity properties. Performance shows that the proposed one can decrease time and space overhead while searching for Web accessing sequence pattern when compared with classical algorithm.