String Hashing for Linear Probing

作者
Mikkel Thorup
标识
DOI:10.1137/1.9781611973068.72
摘要

Linear probing is one of the most popular implementations of dynamic hash tables storing all keys in a single array. When we get a key, we first hash it to a location. Next we probe consecutive locations until the key or an empty location is found. At STOC'07, Pagh et al. presented data sets where the standard implementation of 2-universal hashing leads to an expected number of Ω(log n) probes. They also showed that with 5-universal hashing, the expected number of probes is constant. Unfortunately, we do not have 5-universal hashing for, say, variable length strings. When we want to do such complex hashing from a complex domain, the generic standard solution is that we first do collision free hashing (w.h.p.) into a simpler intermediate domain, and second do the complicated hash function on this intermediate domain. Our contribution is that for an expected constant number of linear probes, it is suffices that each key has O(1) expected collisions with the first hash function, as long as the second hash function is 5-universal. This means that the intermediate domain can be n times smaller, and such a smaller intermediate domain typically means that the overall hash function can be made simpler and at least twice as fast. The same doubling of hashing speed for O(1) expected probes follows for most domains bigger than 32-bit integers, e.g., 64-bit integers and fixed length strings. In addition, we study how the overhead from linear probing diminishes as the array gets larger, and what happens if strings are stored directly as intervals of the array. These cases were not considered by Pagh et al.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
zyy完成签到,获得积分10
刚刚
刚刚
不吃香菜完成签到,获得积分10
1秒前
热情访风发布了新的文献求助10
1秒前
zhong发布了新的文献求助10
1秒前
cyu完成签到 ,获得积分10
2秒前
8R60d8的应助被周周采纳,获得10
2秒前
8R60d8的应助被周周采纳,获得10
2秒前
聪慧芷荷完成签到,获得积分10
3秒前
3秒前
研友_ndvmV8完成签到,获得积分10
4秒前
13867353624发布了新的文献求助10
4秒前
dog完成签到 ,获得积分10
4秒前
荒岛完成签到 ,获得积分10
4秒前
ZHANGLI完成签到 ,获得积分10
4秒前
Hello的应助被renn采纳,获得30
4秒前
4秒前
小书包完成签到,获得积分10
5秒前
凌风发布了新的文献求助10
5秒前
5秒前
SL毕业完成签到,获得积分10
5秒前
自信天真完成签到,获得积分10
5秒前
豆子发布了新的文献求助10
6秒前
6秒前
7秒前
charsiu完成签到,获得积分20
7秒前
7秒前
7秒前
小阳完成签到 ,获得积分10
7秒前
布洛芬发布了新的文献求助10
7秒前
hyc完成签到,获得积分10
8秒前
GU发布了新的文献求助10
8秒前
8秒前
okokok发布了新的文献求助10
8秒前
9秒前
跳动的蓝精灵完成签到,获得积分10
9秒前
bkagyin的应助被yangang采纳,获得10
9秒前
芥末葱发布了新的文献求助30
9秒前
青柠完成签到 ,获得积分10
9秒前
lunhui6453完成签到 ,获得积分10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
Improving the wear resistance of vehicle gear oil by oil soluble LaF3 nanoparticles and typical additives of gear oil 500
Boundaries and Bodhisattvas 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8184061
求助须知:如何正确求助?哪些是违规求助? 9573151
关于积分的说明 21829878
捐赠科研通 7781058
什么是DOI,文献DOI怎么找? 3434216
关于科研通互助平台的介绍 2558337
邀请新用户注册赠送积分活动 2480674