Hashing哈希函数(Introduction to Algorithms, 算法导论，CLRS)学习笔记

Hashing

• Hashing fundamentals
• Application: Unordered sets
• Hash table with chaining
• Practical universal hash functions
• Application: Coordinated sampling

1. Hashing fundamentals

• Notation:

  • For $n\in N$:

    [ n ] = { 0 , . . . , n − 1 } [n]=\{0,...,n-1\} [n]={ 0,...,n−1}

    [ n ] + = { 1 , . . . , n − 1 } [n]_+=\{1,...,n-1\} [n]+​={ 1,...,n−1}

  • Expectation of indicator variable:

    $E[X]=Pr[X=1]$

    $E[{\sum }_i{X}_i]={\sum }_{i}E[X_i]$

1.1 Hash function

Given a universe $U$ of keys, and a positive integer $m$.

Definition

• A (random) hash function $h:U\to [m]$ is a randomly chosen function from $U\to [m]$. Equivalently, it is a function $h$ such that for each $x\in U,h(x)\in [m]$ is a random variable.

  (We randomly project the original $U$ to a set of $[m]$)

• Three things we care about:

  • Space need to represent h h