1) Spatial join operation
空间连接运算
2) spatial join algorithm
空间连接算法
3) join operation
连接运算
1.
Algorithms of estimating the sizes of query results of selection operations and join operations are designed, and corresponding experiments are implemented, and a clue of further research is given.
设计了用直方图估计选择运算与连接运算结果大小的算法，进行了相应的实验，并提出下一步工作的思路。
4) spatial joins
空间连接
1.
Analytical cost model for spatial joins using R-trees;
基于R树的空间连接查询代价分析
2.
However,the exact intersection test of two spatial objects is the most timeconsuming and I/O-consuming step in processing spatial joins.
但是,两个空间对象的精确相交测试是空间连接过程中最耗时、最耗I/O的。
6) spatial join
空间连接
1.
Improved cost model for spatial joins using R-trees
改进的基于R树的空间连接代价模型
2.
R-tree spatial join algorithm BFGS (Breadth-First Group-based Sweeping) was introduced based on the breath-first group-based plane sweeping paradigm.
研究了一种基于广度优先搜索的层内分组扫描策略的R树空间连接新算法。
3.
After analyzing the previous researches on the spatial join, this paper introduced a new method, orthogonal polygons, to approximate actual spatial data in spatial access methods, and to join spatial relation based on R trees.
空间查询效率是衡量空间数据库性能的关键 ,而空间连接查询是最耗时、最重要的空间查询 。
补充资料：不定积分的运算法则
又称为“不定积分的性质”，包含如下两个性质：
（1）设函数f(x)的原函数存在，k是常数，k≠0，则
∫kf(x)dx=k∫f(x)dx
（2）设f(x),g(x)是两个可积分的函数，则
∫[f(x)+g(x)]dx=∫f(x)dx+∫g(x)dx
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条