This paper presents an algorithm to dispatch the operations of the query tree, parallelize queries, and shorten the query time.
针对这种情况，本文提出一种对数据库查询树的分配算法，使查询并行化，缩短查询的响应时间。
The article designs a kind of SPDB organization based on key tree and corresponding query algorithm, which makes average query length shorten a lot.
该文设计了一种基于键树思想的SPDB组织方式和相应的查找算法，使平均查找长度大为缩短。
We define a query tree to connect the user input with semantic query language SPARQL and study the algorithm to converse the query tree to SPARQL.
并设计了查询树这一数据结构用来连接用户输入和SPARQL语义查询语言，且研究了查询树和SPARQL的转换算法。
Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed.
在研究无序树包含匹配的基础上，提出一种新的基于XML的软件构件查询匹配算法。
The method of distributed query optimization is analyzed deeply which use semi-join algorithm and query tree disassembling.
并用实例证明其相对于没有进行分布式查询优化的算法可以大大减少网络上传输的数据量。
A new method of tree scheme knowledge representation is proposed. It enables the recursive query process to consult the states of the extensional database, making the algorithm more efficient.
提出了一种树形知识表示方法，使递归查询可参考事实库状态，从而获得更高效的算法。
A new method of tree scheme knowledge representation is proposed. It enables the recursive query process to consult the states of the extensional database, making the algorithm more efficient.
提出了一种树形知识表示方法，使递归查询可参考事实库状态，从而获得更高效的算法。
应用推荐