id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
5255	Murray, D. M.	A Scatter Storage Scheme for Dictionary Lookups	1970-09-01	29	.pdf	application/pdf	8205	1027	79	input word by the length of the hash table and using the remainder. During lookup, the input word can then be compared with the character string to verify that the correct table entry has In the virtual scatter storage system described later, the hash table has a single dictionary entry, and slots containing a pointer to a collision chain A word being given, its hash address is computed and the tables searched to Suppose a hash table has H slots and that N words are to be entered in Let H, be the expected number of hash table slots virtual hash address is taken large enough, the expected number of collisions "' In order to use a virtual hash scheme, the virtual table must be large enough to reduce the expected number of collisions to an acceptable level. tables are filled using these words and the resulting collision and storage 	./cache/5255.pdf	./txt/5255.txt