Abstract
Hashing is a widely used technique for performing dictionary operations. Even though it is selected from the problem of collision, alternative hashing technique, open addressing has been developed. One such open addressing scheme, double hashing uses two hash functions to perform the search. The paper discusses the implication of choosing the hash function and table size, m, to be relatively prime and why it is necessary for searching the hash table in its entirety.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
H.P. Luhn, Keyword in context index for technical literature. Am. Doc. 11(4), 288–295. (1960) ISSN: 0002
A.M. Tenenbaum, Y. Langsam, M.J. Augenstein, Data Structures Using C. Prentice Hall, pp. 456–461, p. 472 (1990) ISBN 0-13-199746-7
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kumar, V. (2020). On the Prerequisite of Coprimes in Double Hashing. In: Singh Tomar, G., Chaudhari, N.S., Barbosa, J.L.V., Aghwariya, M.K. (eds) International Conference on Intelligent Computing and Smart Communication 2019. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-15-0633-8_25
Download citation
DOI: https://doi.org/10.1007/978-981-15-0633-8_25
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0632-1
Online ISBN: 978-981-15-0633-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)