Abstract
The paper presents a new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can be evaluated in constant time.
These functions are used to construct a dynamic hashing scheme that performs in real time, i.e., a Monte Carlo type dictionary that uses linear space and needs worst case constant time per instruction. Thus instructions can be given in constant length time intervals. Answers to queries given by the algorithm are always correct, the space bound is always satisfied, and the algorithm fails only with probability O(n −k), where n is the number of data items currently stored. The constant k can be chosen arbitrarily large.
Supported in part by DFG Grant ME 872/1-3
Chapter PDF
References
Aho, H. V., and Lee, D., Storing a dynamic sparse table, Proc. of the 27th IEEE FOCS, 1986, pp. 55–60.
Angluin, D., and Valiant, L. G., Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. Syst. Sci. 18 (1979), 155–193.
Brassard, G., and Kannan, S., The generation of random permutations on the fly, IPL 28 (1988) 207–212.
Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E., Dynamic perfect hashing: Upper and lower bounds, Proc. of the 29th IEEE FOCS, 1988, pp. 524–531; also: Tech. Report No. 282, Fachbereich Informatik, Universität Dortmund, 1988.
Dietzfelbinger, M., and Meyer auf der Heide, F., An optimal parallel dictionary, Proc. of ACM Symp. on Parallel Algorithms and Architectures, 1989, pp. 360–368.
Dietzfelbinger, M., Meyer auf der Heide, F., How to distribute a dictionary in a complete network, Proceedings of the 22nd ACM STOC, 1990.
Fredman, M. L., Komlós, J., and Szemerédi, E., Storing a sparse table with O(1) worst case access time, J. ACM 31(3), 1984, 538–544.
Gil, J., Meyer auf der Heide, F., and Wigderson, A., Not all keys can be hashed in constant time, Proc. of the 22nd ACM STOC, 1990.
Hofri, M., Probabilistic Analysis of Algorithms, Springer Verlag, New York, 1987.
Karlin, A., and Upfal, E., Parallel hashing — an efficient implementation of shared memory, Proc. of the 18th ACM STOC, 1986, pp. 160–168.
Kruskal, C. P., Rudolph, L., and Snir, M., A complexity theory of efficient parallel algorithms, Proc. of 15th ICALP, 1988, pp. 333–346, Springer LNCS 317; also: revised preprint.
Lipton, R.J., and Naughton, J.G. Clocked adversaries for hashing, Tech. Rep. CS-TR-203-89, Princeton, 1989.
Mehlhorn, K., Data Structures and Algorithms, Vol. 1, 1984, Springer Verlag, Berlin.
Mehlhorn, K., and Vishkin, U., Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memory, Acta Informatica 21, 1984, 339–374.
Ranade, A. G., How to emulate shared memory, Proc. of the 28th IEEE FOCS, 1987, pp. 185–194.
Siegel, A., On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, Proc. of the 30th IEEE FOCS, 1989, pp. 20–25.
Upfal, E., Efficient schemes for parallel communication, J. ACM 31(3), 1984, 507–517.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dietzfelbinger, M., Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032018
Download citation
DOI: https://doi.org/10.1007/BFb0032018
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52826-5
Online ISBN: 978-3-540-47159-2
eBook Packages: Springer Book Archive