The basic structural join is a core operation in XML query processing.
基本的结构连接是XML数据库查询处理的一个核心操作。
Efficient structural join is the key operation in XML query processing.
有效的结构连接是XML查询处理的关键。
Queries of XML documents include two categories, one is the value queries, the other is structural join queries.
XML文档的查询包括两类查询，一类是值的查询，一类是结构的查询。
Motivated by this observation, a structural join algorithm based on range partitioning is proposed in this paper.
基于这样的观察，提出了一种基于区域划分的结构连接算法。
As join operation to relational database, structural join order selection is at the heart of query optimization in an XML database.
和关系数据库中的连接运算一样，结构连接顺序的选择是XML数据库查询优化的核心。
As the core operation of XML query processing, the efficient implementation of structural join is the key to improve XML query processing.
作为XML查询处理的核心操作，结构连接操作的高效实现是提高查询处理效率的关键。
The algorithm uses Simple API for XML(SAX) parser and structural join, matches and outputs all following-sibling nodes of the given nodes.
采用SAX解析器与结构连接方法，对XML文档中所有已知节点与后兄弟节点进行精确匹配并输出。
To facilitate path expression processing, the processing strategy based on path decomposition and structural join operation needs to be investigated more deeply.
为了加速路径表达式处理，基于路径分解和结构连接操作的处理策略需要更深入的研究。
There have been a number of algorithms proposed for structural join, and most of them are based on one of the following assumptions: the input element sets either have indexes or are ordered.
目前已经提出了许多结构连接的算法，它们中的大多数都基于如下的前提条件之一：输入元素集合存在索引或者有序。
Structural join is the core operation in XML query processing, there have been a number of algorithms proposed for structural join, but all of them could not support query of multiple versions XML.
结构化连接是XML查询处理的核心操作，目前已经提出了许多结构化连接的算法，但都不支持多版本的XML文档。
Structural join is the core operation in XML query processing, and catches the research community's attention.
结构连接是XML查询处理的核心操作，受到了研究界的关注。
Structural join is the core operation in XML query processing, and catches the research community's attention.
结构连接是XML查询处理的核心操作，受到了研究界的关注。
应用推荐