XML Structural Join Algorithm Based on Extended Region Coding
Xiaojuan Zhu
Abstract
Xiaojuan Zhu
Abstract
The efficiency of structural join directly influences the function of the XML query.The classical Anc-Des-B+algorithm's ability of skipping the descendant codes(not child) is not effective when judging the parent/child relationships.Based on the idea of extended region coding,this paper puts forward a kind of improved method which codes every node into a group of 6 elements including the parent's information.It also puts forward the ZParent algorithm which can skip all nodes that don't participate in join and can carry out join calculation with only one time to scan the P list and C list.Experimental result shows that the method has better time function.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The efficiency of structural join directly influences the function of the XML query.The classical Anc-Des-B+algorithm's ability of skipping the descendant codes(not child) is not effective when judging the parent/child relationships.Based on the idea of extended region coding,this paper puts forward a kind of improved method which codes every node into a group of 6 elements including the parent's information.It also puts forward the ZParent algorithm which can skip all nodes that don't participate in join and can carry out join calculation with only one time to scan the P list and C list.Experimental result shows that the method has better time function.
Key concepts: Computer science, Join (topology), XML, Coding (social sciences), Algorithm, Node (physics), Theoretical computer science, World Wide Web