1) non-recursive queries
非递归查询
2) recursive query
递归查询
1.
It also defines partial order b,and on the basis of it the monotonicity of these operators,especially recursive query is discussed.
同时还定义了偏序关系ｂ，并在其上讨论了这些操作的单调性，特别是递归查询。
2.
This paper describes formally recursive query with relational algebra and datalog rule based on logical, and also discusses the least-fixed point computation equation and the principle of stratified negation in recursive query.
递归查询为包含多重层次结构的关系数据提供了一种非常灵活而有效的处理方法。
3.
The traditional method mainly focuses attention on a large number of queries on the XML data stream, which doesn’t meet the present need, so how to complete the recursive query over XML data stream is an urgent problem.
传统算法的关注点主要集中在XML数据流上执行海量的XPath查询,无法适应当前新的情况,因此有效地实现XML数据流递归查询成为当前迫切需要解决的问题。
3) Structurally Recursive Queries
递归查询
1.
The Technique of Optimizing Structurally Recursive Queries by DTD;
用DTD优化XML递归查询技术
4) SQL recursive query
SQL递归查询
1.
Due to the stratification restriction,representing rollup operation on recursive hierarchy as SQL recursive query will cause considerable overhead and is thus inefficient.
然而,对于递归层次而言,由于SQL递归对于聚集函数分层的限制,如果将上翻操作表示为SQL递归查询,则会导致效率低下。
5) recursive query evaluation
递归查询演算
6) linear recursive query
线性递归查询
1.
Designing and implementation of linear recursive query algorithm;
一个线性递归查询算法的设计与实现
补充资料：非想非非想处天
1.佛教语。即三界中无色界第四天。此天没有欲望与物质﹐仅有微妙的思想。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条