助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   关键字集合 的翻译结果: 查询用时:0.037秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

关键字集合
相关语句
  key set
    As a consequence,the key set's frequency characteristic and the first and last characters queue characteristic will be kept relatively in all sortings.
    使整个关键字集合在排序过程中相对保持其频率特性和首末字符的队列特性.
短句来源
  key set
    As a consequence,the key set's frequency characteristic and the first and last characters queue characteristic will be kept relatively in all sortings.
    使整个关键字集合在排序过程中相对保持其频率特性和首末字符的队列特性.
短句来源
  “关键字集合”译为未确定词的双语例句
    CONSTRUCTING MINIMAL PERFECT HASH FUNCTIONS FOR LARGE-SCALE KEY SETS
    为大型关键字集合构造最小完全HASH函数
短句来源
    The backtracking method can be quite limitized and normalized to construct minimal perfect HASH function.
    从而使求关键字集合最小完全HASH函数的回溯方法更加局部化和规范化;
短句来源
    In this paper, the concepts, such as set of the same kind attributes, family of sets of the same kind prime attributes, set of the free same kind attributes, and set of the half-free same kind attributes, are proposed, and then, a polynomial-time algorithm to find a candidate key of minimum cardinality on a relation schema in O(n2p)is given.
    作者在深入分析主属性在FD集、最小基数候选关键字关系模式和候选关键字集合中的结构特性的基础上,提出了同类属性集,同类主属性组集族,自由、半自由同类属性集等概念。 在此基础上,给出了一个求关系模式最小基数候选关键字的O(n2p)级算法。
短句来源
查询“关键字集合”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  key set
Sufficiently precise measurements of a key set of lines may be combined to deduce separately the distributions of the fast protons and α-particles that produce the narrow de-excitation lines.
      
A key set of assumptions in this report centres on the allocation of responsibility for measures.
      
A process known as cytoplasmic polyadenylation regulates one key set of maternal messages.
      
A key set of common functions and basic services must be supported to have a viable service offering.
      
Another key set of effects centered on processes associated with achieving legitimacy and full engagement of the client group.
      
更多          


In this paper, a machine independent minimal perfect hash function is introduced. This paper presents a third ordering to prune the search tree and presents a scheme which we call the double variants bounding scheme and a new pre-checking scheme to speed up the search. In order to extend the application of this function, linear probing and separate chaining are presented to resolve the collision problem; First character sequence grouping is used to process large key sets. In addition,a universal process program...

In this paper, a machine independent minimal perfect hash function is introduced. This paper presents a third ordering to prune the search tree and presents a scheme which we call the double variants bounding scheme and a new pre-checking scheme to speed up the search. In order to extend the application of this function, linear probing and separate chaining are presented to resolve the collision problem; First character sequence grouping is used to process large key sets. In addition,a universal process program is introduced and some examples are given.

本文简介了独立于机器的最小完善Hash函数,提出用第三次排序修剪搜索树,用双自变量定界法和超前检查法加快搜索速度。为扩大此种Hash函数的应用范围,文中提出解决冲突问题的线性补偿法和分离勾链法,探讨了用首字母顺序分组法处理较大的关键字集合。文中还介绍了一个通用处理程序,并给出若干计算实例。

In this paper,key set's queue-sorting and fill-sorting have been improved and presented based on reference(1).As a consequence,the key set's frequency characteristic and the first and last characters queue characteristic will be kept relatively in all sortings.The backtracking method can be quite limitized and normalized to construct minimal perfect HASH function.It is very evident that the distance of backtracking will be abridged,the computing complexity will be decreased and the quality of HASH function constucted...

In this paper,key set's queue-sorting and fill-sorting have been improved and presented based on reference(1).As a consequence,the key set's frequency characteristic and the first and last characters queue characteristic will be kept relatively in all sortings.The backtracking method can be quite limitized and normalized to construct minimal perfect HASH function.It is very evident that the distance of backtracking will be abridged,the computing complexity will be decreased and the quality of HASH function constucted will be improved.The typical utility PASCAL program and concrete example key set's sorting results are shown too in this paper.

本文在文献[1]的基础上改善和提出了队列排序和填空排序方法.使整个关键字集合在排序过程中相对保持其频率特性和首末字符的队列特性.从而使求关键字集合最小完全HASH函数的回溯方法更加局部化和规范化;在缩短回溯距离、降低计算复杂度和提高HASH函数质量上均有明显效果.文中还给出了排序中典型且实用的PASCAL程序和实例关键字集合的排序结果.

In this paper, base on the presented working, an intelligent backtracking procedure has been improved in all respects to construct minimal perfect HASH functions for large-scale key sets. The backtracking controling algorithms to restrict increacing of the threshold values of the first-last characters and to restrict the relative backtracking distances have been presented. In these algorithms, following strategys have been applied. The backtracking points not take near neighbour but rather far to avoid rapid...

In this paper, base on the presented working, an intelligent backtracking procedure has been improved in all respects to construct minimal perfect HASH functions for large-scale key sets. The backtracking controling algorithms to restrict increacing of the threshold values of the first-last characters and to restrict the relative backtracking distances have been presented. In these algorithms, following strategys have been applied. The backtracking points not take near neighbour but rather far to avoid rapid increacing of the threshold values; Under the condition of the threshold values not increacing, select the big sequential number backtracking point as many as possible; When computing point sequential number big to some value CONP, assure selected backtracking point sequential number not less to some value CONV. And after building mathematical outline of the minimal perfect HASH functions and proving out-bound theorems, a number of methods for backtracking out-bound processing have been presented. Above improved backtracking methods have been implemented in a microcomputer by PASCAL languages. The reliability of the theorems and the effectiveness of the methods has been pro-ved by a number of computing results.

为了给大型关键字集合构造 MPHF,本文在现有工作的基础上,对回溯过程作了多处改进。提出了限制阈值增长和相对回溯距离的回溯控制算法:该算法的策略是,为了限制阈值的过快增长,回溯点宁可舍近求远;在不引起阈值增长情况下,尽可能选择序号大的回溯点;当计算在序号大于某额定值 conp 后,确保所选回溯点序号不小于某额定值 conv。在建立MPHF 的数学描述并证明有共越界定理后,提出了一系列回溯越界处理方法。本文所述改进回溯方法已在微机上用PASCAL 语言实现,其大量计算结果表明,所提出的理论是正确的,方法是行之有效的。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关关键字集合的内容
在知识搜索中查有关关键字集合的内容
在数字搜索中查有关关键字集合的内容
在概念知识元中查有关关键字集合的内容
在学术趋势中查有关关键字集合的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社