Index-supported on XML-documents containing links

Several approaches of path indexes have been proposed in recent times for evaluating path expressions. Most of these path indexes cannot efficiently handle a large set of linked XML documents and can not efficiently handle ancestor-descendant queries over long paths. In this paper, we proposed an efficient path index mechanism for fast and efficient evaluation of path expressions in linked and unlinked XML documents over long path with wildcards, our index depends on the labeling scheme to answer the query of type ancestor-descendants relationship on a large graph, by looking only at the labels, such that the two labels L(A) and L(B) would contain enough information to answer the required path expression A//B on linked XML documents.