Parsing of global query generates a query tree.
查询语句解析产生查询树。
Pattern trees form a natural basis to query tree-structured data such as XML and LDAP.
模式树是对像XML和LDAP等树形结构数据进行查询的基础。
This paper presents an algorithm to dispatch the operations of the query tree, parallelize queries, and shorten the query time.
针对这种情况,本文提出一种对数据库查询树的分配算法,使查询并行化,缩短查询的响应时间。
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的转换算法。
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
在路径分解和查询计划选择的过程中,利用查询树中的目标节点来避免中间结果的传递。
In the procedure of path decomposition and query plan selection, target node in the query tree is utilized to avoid the transfer of the intermediate results.
在路径分解和查询计划选择的过程中,利用查询树中的目标节点来避免中间结果的传递。
应用推荐