Abstract: In this paper, a further discussion of graded searching is presented. We propose another method of searching called twice graded searching, which treats any non-uniformally-distributed data efficiently. This paper is an extension of 1.