Abstract: Anextent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules,path-shortening andpath-complementing, are presented in this paper.Path-shortening reduces the number of joins by shortening the path whilepath-complementing optimizes the path execution by, using an equivalent complementary path expression to compute the original one. Experimental results show that the algorithms proposed are more efficient than traditional algorithms.
0 Replies
Loading