A New Encoding-based XML Structural Join Algorithm

The structural join operations of judging the parent-child relationship or ancestor-descendant relationship between XML nodes are always included in the process of structural query of XML document.At present,a series of effective structural join algorithms has been proposed,and almost all of these algorithms are based on merging thought to make use of the best characteristics of XML data structure to reduce the cost of join scanning.This paper presents a new encoding scheme and further designs a structural join algorithm StrucContact.This algorithm integrated the functions of the two structural join algorithms of Holistic Twig(PathStack algorithm and TwigStack algorithm) and the experiments show that it can greatly improve the efficiency of the structural join operations.