将工作分区与它们的数据分区进行匹配，这将增加服务器缓存的命中概率，并减少对数据库的远程访问，后者会引起较大的延迟。
Matching work partitions to their data partitions will increase the probability of a cache hit within the server and decrease remote accesses to the database, which introduces quite a bit of latency.
要计算数据访问时间，您需要了解数据存在于近缓存中、服务器缓存中、以及数据库中的概率。
To compute the data access time, you need to know the probabilities for the data existing in the near-cache, in the server cache, and in the database.
关联规则是数据库中某些特定事件一起发生的概率的简单陈述。
Association rule is a simple statement about the cooccurrence probability of some certain events in database.
为克服数据库因果关系条件概率矩阵维数灾，将因果关系转化为线性多项式，可使计算简便。
To overcome dimension curse of conditional probability matrix, casual rules in databases is converted to linear polynomial, which makes calculation simple.
在包括190人的人脸数据库上的实验结果表明，所提出方法的识别性能较现有的概率子空间分析方法有了较明显的改善。
The experimental results on a mixture face database including 190 individuals show that the proposed GPSA method outperforms the existing PSA method.
针对数据库中数据访问的倾斜性，文章提出建立基于数据访问概率的索引技术，并给出了ORD算法，它可以根据给定的索引树创建最优的广播序列。
Due to the data access skew, index technology based on data access probability is proposed. At last ord algorithm is proposed to create optimal broadcast sequence according to given index tree.
针对数据库中数据访问的倾斜性，文章提出建立基于数据访问概率的索引技术，并给出了ORD算法，它可以根据给定的索引树创建最优的广播序列。
Due to the data access skew, index technology based on data access probability is proposed. At last ord algorithm is proposed to create optimal broadcast sequence according to given index tree.
应用推荐