Scribd Logo
Upload

Welcome to Scribd!

  • Perfect and Cuckoo Hashing Data Structures Course-Scribbles

    Uploaded by

    bardia.hszd
    7 views21 pages
    This document discusses a proof that for any set of hash functions mapping elements to buckets, the probability that two randomly chosen elements collide in the same bucket is upper bounded by 1/b, where b is the number of buckets. It shows this by first considering the probability that a specific pair of elements collide, then taking the union bound over all pairs to generalize to any two randomly chosen elements.

    Original Description:

    Original Title

    Perfect_And_Cuckoo_Hashing___Data_Structures_Course-scribbles

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses a proof that for any set of hash functions mapping elements to buckets, the probability that two randomly chosen elements collide in the same bucket is upper bounded by 1/b, where b is the number of buckets. It shows this by first considering the probability that a specific pair of elements collide, then taking the union bound over all pairs to generalize to any two randomly chosen elements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views21 pages

    Perfect and Cuckoo Hashing Data Structures Course-Scribbles

    Uploaded by

    bardia.hszd
    This document discusses a proof that for any set of hash functions mapping elements to buckets, the probability that two randomly chosen elements collide in the same bucket is upper bounded by 1/b, where b is the number of buckets. It shows this by first considering the probability that a specific pair of elements collide, then taking the union bound over all pairs to generalize to any two randomly chosen elements.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 21

    H : { ,...

    , }

    : → { ,..., − }.

    #=

    P ∈H ( ( ) = ( )) ≤
    ∈H
    ,...,

    !
    P( )≤ .
    = , !=

    ×
    log( )
    ( log(log( )) )

    log ( )
    = log (log ( )) ≈ =
    ∈H
    ≤ ≤

    ( − )
    P( )≤ × ≤ .

    =
    P( )≤ .
    ∈H
    =

    −
    =
    !
    ≤ =

    You might also like