Talk:Double hashing
Latest comment: 2 months ago by 2409:40F0:2C:5F80:8000:0:0:0 in topic Double hashing
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
New section
editThe second function has to be subtracted.
- The presentation in Knuth does subtract the offset produced by the second hash function, but the important thing is that the offset is a function of the key, and that it be in the interval {1,T-1}. The offset can be added or subtracted. Sbalfour (talk) 16:01, 18 September 2019 (UTC)
Linear and Quadratic double hashing
editJust as there is linear and quadratic probing to resolve collisions, there is linear and quadratic double hashing, and as might be suspected analogous to the probing cases, quadratic double hashing is superior to linear double hashing. The entire content of this article is about linear double hashing. I propose we either add quadratic double hashing here, or split off an article for it. Sbalfour (talk) 16:29, 18 September 2019 (UTC)
- @Sbalfour: I'm unable to find a citation for "Quadratic double hashing" (searching for that phrase turns up only comparisons of quadratic hashing and double hashing), but I added § Enhanced double hashing which I think covers the field. 196.247.24.12 (talk) 22:16, 5 March 2020 (UTC)
Double hashing
editHashin. Hashing is a technique ysed in conjunction
2409:40F0:2C:5F80:8000:0:0:0 (talk) 00:55, 23 September 2024 (UTC)