Sibling Relation Query Algorithm without any Parents’ Information
XU Juan
YAO Rugui
Abstract：Considering a class of special and complex sibling relation query without any parents’ information ,an effi‐cient algorithm is proposed .The efficient labeling scheme and two‐stack‐based storing method are carefully regulated to ac‐celerate the query process .And then the operation conditions for the two stacks and the operation of the current processing node are concluded .The experiment results show that ,by simply computation of the P/C and Following relationship ,a lot of invalid nodes can be skipped quickly and the query can be accelerated .Therefore ,this proposed algorithm can well settle the complex sibling query ,and output XML document segment in correct document order .
Keywords：XMLlabeling schemedynamic updatelayered structurestructural join
Publication Date：2015-01-01
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 159-163,247 )