A buffering based cache-oblivious nest-loop parallel join algorithm is proposed.
提出了一种基于缓冲的高速缓存参数无关的嵌套循环并行连接算法。
We present different join algorithm by considering an effect based on the structure of basic Windows.
我们考虑了复合滑动窗口中的基本窗口结构对连接算法的影响，给出了不同的实现算法。
Motivated by this observation, a structural join algorithm based on range partitioning is proposed in this paper.
基于这样的观察，提出了一种基于区域划分的结构连接算法。
The method of distributed query optimization is analyzed deeply which use semi-join algorithm and query tree disassembling.
并用实例证明其相对于没有进行分布式查询优化的算法可以大大减少网络上传输的数据量。
The contributions of this paper are as the followings:(1) A simple spatial join algorithm is constructed by the single point query for spatiotemporal datasets.
利用时空数据集的单点查询方法，组成了一种比较朴素的时空连接的算法。
This paper analyses the problems of load balancing on every site in parallel databases, presenting a parallel join algorithm with high efficiency and load balancing and analogue experiments are made.
本文分析了并行数据库中各结点的负载平衡问题，提出了一个高效且保持负载平衡的并行连接运算算法，并进行了模拟实验。
Configure the H-Join to use in-memory algorithm - in the H-Join Step, after defining the parent and child lists, there is an option to select the algorithm that should be used.
配置H -Join以使用内存中算法—在H - JoinStep中，定义父列表和子列表后，有一个选项来选择应使用的算法。
The algorithm by which a join operation is performed (join method).
被执行的联接操作的算法(联接方法)。
The fork-join approach offers a portable means of expressing a parallelizable algorithm without knowing in advance how much parallelism the target system will offer.
fork-join方法提供了一种表示可并行化算法的简单方式，而不用提前了解目标系统将提供多大程度的并行性。
This paper presents an optimized query algorithm, which adopts direct-join using data partition and parallel processing. It can reduce the response time of query process.
本文利用数据分片和并行处理策略，提出一种采用直接连接的查询优化算法，能有效地缩减查询处理的响应时间。
By using this algorithm, the problem of late join brought in collaborative design in the distributed environment is well solved.
该算法的实现使得在分布式计算环境下协同设计的迟加入问题得到了较为完善的解决。
There are detailed presentation of fusion algorithm and join tree theory which are correlative with DST.
并详细介绍了与证据组合相关的熔合算法与连接树理论。
For the reason of the no order of space data, the algorithm based on join index have to improve for it. The key problem of optimal page-access sequence with a fixed Buffer has been analyzed.
空间数据的无序性，使得应用在其上的利用连接索引的算法需要进一步的改进，为此分析了其中关键的最佳页访问次序问题。
This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.
本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
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文档中所有已知节点与后兄弟节点进行精确匹配并输出。
In the algorithm the items and the sequence are discussed respectively, and the time join method is used to introduce the candidate sets, so the frequent sets can be gotten.
该算法考虑了项目集与序列之间的关系，利用时序连接法，采用不同的构造法，构造出相对应的候选集，从而计算出频繁集。
This paper gives a dissolution algorithm on relational data model system which has a lossless join and remains function dependency as well.
给出了关系数据模式分解中，既有无损连接性又保持函数依赖的分解算法，并用该算法指导应用软件的开发工作。
This paper gives a dissolution algorithm on relational data model system which has a lossless join and remains function dependency as well.
给出了关系数据模式分解中，既有无损连接性又保持函数依赖的分解算法，并用该算法指导应用软件的开发工作。
应用推荐