ScholarLens Back to search
2008•Harbin Ligong Daxue xuebaoRequires access

Efficient Structural Join for XML Based on Region Encoding

Hao Zhong-xiao

Open publisher page 0 citations

Abstract

This paper gives document-tree data model for XML document,and encodes every node in document tree.Secondly,it improves merge structural join which is based on buffer,and gives a new efficient algorithm to process structural join for containment relationship nodes.It can get all pairs of ancestor/descendant or parent/child after scan ancestor List and descendant List once.even,it can skip nodes which don't participate join.

About this research paper

What this paper is about

This paper gives document-tree data model for XML document,and encodes every node in document tree.Secondly,it improves merge structural join which is based on buffer,and gives a new efficient algorithm to process structural join for containment relationship nodes.It can get all pairs of ancestor/descendant or parent/child after scan ancestor List and descendant List once.even,it can skip nodes which don't participate join.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper gives document-tree data model for XML document,and encodes every node in document tree.Secondly,it improves merge structural join which is based on buffer,and gives a new efficient algorithm to process structural join for containment relationship nodes.It can get all pairs of ancestor/descendant or parent/child after scan ancestor List and descendant List once.even,it can skip nodes which don't participate join.

Key concepts: Computer science, Merge (version control), Descendant, Sort-merge join, Join (topology), XML, Hash join, Encoding (memory)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient Structural Join for XML Based on Region Encoding — Research Paper | ScholarLens