期刊名称：Journal of Computing and Information Technology
印刷版ISSN：1330-1136
电子版ISSN：1846-3908
出版年度：2004
卷号：12
期号：3
页码：237-250
出版社：SRCE - Sveučilišni računski centar
摘要：XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches reduce complex join expressions to several binary structural joins. It implies generation of superfluous intermediate data. In this paper, we propose a new structural join algorithm, called sequence join algorithm, for sequential regular path expressions. It exploits information about position of the elements in the document to skip generation of the redundant intermediate lists. The algorithm performs merge of several input lists of nodes in one pass. Experimental results prove the structural join algorithm is better than multiple binary join algorithm for queries of both small and large cardinality.
