2-choice hashing

#	Item
1	Algorithms and Data Structures Winter TermExercises for Unit 11 s 1. For this question assume we have n buckets, B1 , . . . , Bn , initially empty, and an unlimited Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-07 07:14:38 Search algorithms Hashing Cuckoo hashing Hash function 2-choice hashing Locality-sensitive hashing
2	Application Note: Scalable HashingProblem How can you use Judy to create a scalable hash table with outstanding performance and automatic scaling, while avoiding the complexity of dynamic hashing? Add to Reading List Source URL: judy.sourceforge.net Language: English - Date: 2004-09-10 16:20:39 Search algorithms Information science Information retrieval Hashing Computer programming Hash table Hash function Trie Judy array Hash Cuckoo hashing 2-choice hashing
3	Lecture 8, ThursdayHashing (Chapter 12) O Heaps support: Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2001-05-09 21:50:02 Open addressing Hash function Linear probing 2-choice hashing Hash table Hashing Search algorithms Information science