Abstract
This chapter is a brief introduction to hashing which is a technique that can be used to perform operations such as insertions, deletions, and searches efficiently. It introduces simple hash functions and discusses how to deal with collisions. The chapter also shows implementation of hash tables using the hashMap class and the hashSet class defined in Java Application Program Interface (API). A small database is created with the hashMap class using simple GUI in the complete program.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Streib, J., Soma, T. (2017). Hashing. In: Guide to Data Structures. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-70085-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-70085-4_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-70083-0
Online ISBN: 978-3-319-70085-4
eBook Packages: Computer ScienceComputer Science (R0)