| In an XML database, for efficient evaluation of XML queries, finding all the occurrences of a twig pattern is a basic operation. Based on region encoding labeling scheme numerous algorithms have been proposed to process a twig query. Instantly, region encoding assists efficient determination of structural relationship between two elements; we examine that the information within a single label is very confined. In this, we consider a labeling scheme, called extended Dewey. From the label of an element we can derive all the elements' names along the path from the root to the element, so this is a competent labeling scheme. A holistic twig join algorithm, called TJFast is based on extended Dewey. TJFast only needs to access the labels of the leaf query nodes, to answer a twig query alike all previous algorithms which are based on region encoding. Actually, in TJFast, it is inefficient for executing the large number of input queries. In this experiment, further, we automated the Extended Dewey and TJFast code by giving the XML query itself as an input so that it converts the query into XML program instead of writing XML program as input for every query. Thus, this automation helps us to execute a large number of input queries of different kinds such as existential, regular and linear path, which is difficult to be answered by TJFast algorithm.;Finally, we show that our modified automated experiment is efficient to the previous approach and report our experimental results on the efficiency of different types of queries like linear path, existential path and regular path queries of both ancestor-descendant and parent-child relationships with datasets Treebank and DBLP. We also observed that TJFast does not execute when repetition of elements are involved in the query or data. And also we compared time efficiency of different types of queries with respect to number of elements too. |
