## Hashing, searching, sketching |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Introduction | 1 |

Efficient Hashing | 8 |

Balanced Allocation on Graphs | 27 |

Copyright | |

7 other sections not shown

### Other editions - View all

### Common terms and phrases

approximate nearest neighbor backward search balls and bins binary tree bits bucket c-approximate cell Chernoff bounds choices choosing chosen compute constant construction contributing paths counter counting Bloom filter cuckoo hashing curse of dimensionality cycles data structure database deletions denote distribution dlCBF Earth Mover's Distance entropy Euclidean space false positive probability fraction frequency frequent element given hash family hash table hash value high probability inner product input inserts instance kd-tree l2 norm labels Lemma linear space load at least locality sensitive hash log log lower bound maximum load metric min-hash nearest neighbor problem nearest neighbor search node with load objects obtained perform permutations probability at least Proof query point r-steps random graph random point random variable random walk randomly recursively sensitive hash function similarity simulation sketching algorithms standard CBF subgraph subtree super-bin Theorem total number tree-hash upper bound vector weighted witness graph witness tree