Complexity of the federated query: how many sub-operations such as filtering, joining, sorting, and so on, does the federation server need to execute to perform the query.
联合查询的复杂性：为了执行查询，联合服务器需要执行多少筛选、联接、排序之类的子操作。
This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
A new sorting method, the method of transfer sort for special distributed data is presented. Its algorithm description, time complexity and experimental results in assembler language are given.
结合小间隔数据的特点，提出了一种谓之迁移的新排序方法(以下简称为迁移排序)，给出了该排序算法的描述、时间复杂度分析及用汇编语言编写程序进行算法比较的实验结果。
A new sorting method, the method of transfer sort for special distributed data is presented. Its algorithm description, time complexity and experimental results in assembler language are given.
结合小间隔数据的特点，提出了一种谓之迁移的新排序方法(以下简称为迁移排序)，给出了该排序算法的描述、时间复杂度分析及用汇编语言编写程序进行算法比较的实验结果。
应用推荐