虽然这个示例非常简单，但是fork - join技术可用于各种各样的搜索、排序和数据分析问题。
Of course, this is a very simple example, but the fork-join technique is suitable for a wide variety of searching, sorting, and data analysis problems.
在这种情况下，我们的问题不在于是否能够从数据库获取这些记录，因为我们想要测试的是我们是否能够对返回的记录进行排序。
In this case the fact that we could grab the records from the database really doesn't matter, since what we would be testing is our ability to sort the records coming back.
〇为数据库启用了自动关闭的选项时，排序规则列会导致该问题。
The Collation column causes the issue when the Auto Close option is enabled for databases.
对于排序和搜索问题，fork - join库提供了一种表示可以并行化的数据集操作的非常简单的途径：parallelarray类。
For sorting and searching problems, the fork-join library gives you an even easier means of expressing parallelizable operations on data sets: the ParallelArray classes.
着重讨论了异构磁盘系统的数据分配和瓦片分布问题，提出了一种速率均匀虚拟磁盘划分方法和一种虚拟磁盘排序方法。
After studying the questions of data allocation and tile declustering in heterogeneous disk systems, a same-rate virtual disk dividing method and a virtual disk sorting method are proposed.
为了改善真实网络数据集上自动问答系统的性能，定义出新的问题类别集合和通用的答案重新排序模型。
To improve question answering (QA) performance based on real-world web data sets, a new set of question classes and a general answer re-ranking model are defined.
在本文的最后一部分，根据分析问卷调查结果的数据整理和分析，对与企业价值评估模式相关的几个问题，按照重要程度进行了排序。
Meanwhile, in the last section, according to the statistical analysis based on questionnaire, it ranks some relevant points according to their importance.
许多关于数据挖掘和机器学习的研究都集中于分类的研究，然而现实世界涉及到的不仅仅是分类问题，比如对象的排序问题。
Many real world problems deal with ordering objects instead of classifying objects, though most research in machine learning and data mining has been focused on the latter.
如果在EBCDIC数据库上使用设计于操作ascii数据库的应用程序，就可能产生问题，因为其排序序列不同。
An application designed to work against an ASCII database may run into problems if used against an EBCDIC database, because of the difference in the collating sequence.
普通的搜索引擎由于其结构和所存储数据等方面的限制，使其不能很好的解决在数据采集、数据存储、信息查询以及查询结果排序等方面所存在的问题。
Because of the limit in structure and data storage, common search engine cannot solve the problems in data collection, data storage, information searching and sorting of searching result.
对于数据集规模过大而无法一次性完成粒度排序的问题亦是很好的解决方案。
The incremental algorithm is also a good solution to the problem of one-time granular ranking in large-scale databases.
本文结合工作实际需要，对大量数据的排序问题设计了优化算法，并给出了排序优化算法程序。
Combining with the needs of the work, this paper develops an optimization algorithm to deal with the arrange of a vast amount of data and gives the optimization algorithm routine for the arrange.
探讨了聚类分析这一重要的数据挖掘方法在综合评价中的应用，将模糊聚类与综合评价相结合以解决待评价方案数较多的排序问题，并且文中还改进了建立模糊相似矩阵的方法。
Fuzzy clustering is associated with comprehensive assessment in the study of sorting when the number of object is large, and we improve the method of setting up fuzzy similar matrix.
多通道视频流传输的排序问题，在视频数据的传输领域有着重要的地位。
Sorting problem has an important role in the field of video stream transmission.
自从计算机被用来进行大规模的数据处理，数据序列的排序问题便一直成为研究的热点。
The problem of data sorting is still the research focus since computers have been used to process the large scale data information.
本文分析了在GD CM开源库的基础上研究DICOM数据的序列分析与切片排序时遇到的问题，并提出了解决方案。
We analyzed the problems with the GDCM open libraries and proposed our solutions, which have been validated by real clinical data with reliable results.
本文分析了在GD CM开源库的基础上研究DICOM数据的序列分析与切片排序时遇到的问题，并提出了解决方案。
We analyzed the problems with the GDCM open libraries and proposed our solutions, which have been validated by real clinical data with reliable results.
应用推荐