Cuckoo Hashing
Encyclopedia of Algorithms（2001）
摘要
this paper, the associatedinformation of x#S can be stored together with x in a hash table.Therefore we disregard the time and space used to handle associated informationand concentrate on the problem of maintaining S. In the followingwe let n denote|S|
更多查看译文
关键词
space usage,constant lookup time,dictionaries,searching,theoretical performance,data structures,information retrieval,experiments,cuckoo hashing,known method,worst case,average case,binary search tree,hash- ing,efficient dictionary,extensive experiment
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要