In this paper, we discuss a novel access structure called connectivity index which is designed for the efficient evaluation of traversal recursive queries over large acyclic graphs. Unlike the bottom-up evaluation methods, a unique feature of the proposed graph search approach is that it requires only a single-pass scan of the connectivity index file in evaluating traversal recursive queries