Abstract

ABSTRACT Optmaahty questions are examined m the following information retrieval problem. Given a set S of n keys, store them so that queries of the form, "Is x E S? " can be answered quickly It is shown that m a rather general model including all the commonly used schemes, [lg(n + I)] probes to the table are needed m the worst case, prowded the key space is sufficiently large The effects of smaller key space and arbitrary encoding are also explored

Citations

3	Optimal arrangement of keys in a hash table - Rivest - 1978
1	D The Destgn and Analysis of Computer Algornhms - AHO, HOPCROFT, et al. - 1974
1	Multidimensional search problems SIAM J Comput 5 - BERGE, North-Holland, et al. - 1973
1	628 ANDREW CHI-CHIH YAO 9 KNUTH, D E The Art of Computer Programming, Vol 3 Sorting and Searching - KNUTH, Vol - 1968
1	Geometric complexity Proc 7th Ann ACM Symp. on Theory of Computmg - SHAMOS - 1975