高级算法 (Fall 2017)/Hashing and Sketching: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>Etone
imported>Etone
No edit summary
(5 intermediate revisions by the same user not shown)
Line 5: Line 5:
==Flajolet-Martin algorithm==
==Flajolet-Martin algorithm==


=== Markov and Chebyshev inequality===
= Set Membership=
 
=== Analysis of Flajolet-Martin estimator===
 
 
=Membership of Set=


== Perfect hashing==
== Perfect hashing==


=== FKS perfect hashing===
=== FKS perfect hashing===
=== Cuckoo hashing===


==Approximate set membership==
==Approximate set membership==
Line 22: Line 15:
=== Bloom filter ===
=== Bloom filter ===


= Heavy Hitter=
= Frequency Estimation=


== Count-min sketch==
== Count-min sketch==

Revision as of 08:30, 10 October 2017

Count Distinct Elements

An estimator by hashing

Flajolet-Martin algorithm

Set Membership

Perfect hashing

FKS perfect hashing

Approximate set membership

Bloom filter

Frequency Estimation

Count-min sketch