ScholarLens Back to search
2007•Unpublished venueRequires access

Research and Improvement for the Preceding-sibling/Following-sibling Structural Join Algorithm

Zhi Wang

Open publisher page 0 citations

Abstract

By the use of the region coding and node model mapping method, an extended storage schema is presented for relational-database. We establishe clustered index for the optional breadth traversal serial number of node coding to improve the structural join algorithms for processing preceding-sibling/ following-sibling relationships. The proposed method has advantages of saving memory, shrinking the scanning area of list and remarkably improving the rate matching of lookup. This algorithm improves the efficiency of XML data query.

About this research paper

What this paper is about

By the use of the region coding and node model mapping method, an extended storage schema is presented for relational-database. We establishe clustered index for the optional breadth traversal serial number of node coding to improve the structural join algorithms for processing preceding-sibling/ following-sibling relationships. The proposed method has advantages of saving memory, shrinking the scanning area of list and remarkably improving the rate matching of lookup. This algorithm improves the efficiency of XML data query.

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

By the use of the region coding and node model mapping method, an extended storage schema is presented for relational-database. We establishe clustered index for the optional breadth traversal serial number of node coding to improve the structural join algorithms for processing preceding-sibling/ following-sibling relationships. The proposed method has advantages of saving memory, shrinking the scanning area of list and remarkably improving the rate matching of lookup. This algorithm improves the efficiency of XML data query.

Key concepts: Computer science, Tree traversal, Coding (social sciences), Schema (genetic algorithms), Star schema, Algorithm, Relational database, Sort-merge join

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research and Improvement for the Preceding-sibling/Following-sibling Structural Join Algorithm — Research Paper | ScholarLens