Review of Hashing - Database Systems - page 471

• In synonym chaining, each hash address is a reference to a linked

list of items that have that hash address.

• In rehashing, successive hash functions are applied until the

collision is resolved.

• Java facilitates management of hash tables via the Hashtable,

HashMap, and TreeMap classes.

Hashing is widely used in the implementation of filing systems for compilers,
operating systems and database management systems.

A2.6 References and/or Recommended Readings
[Carrano, 2006] Carrano, Frank and Janet Prichard. Data Abstraction & Problem Solving
with Java . Boston, MA: Addison-Wesley, 2006. See Chapter 13.
[Carrano, 2007] Carrano, Frank. Data Structures & Abstraction with Java 2 nd ed. Upper
Saddle River, NJ: Prentice Hall, 2007. See Chapter 19 and 20.
[Drake, 2006] Drake, Peter. Data Structures and Algorithms in Java . Upper Saddle River, NJ:
Prentice Hall, 2006. See Chapter 11.
[Ford, 2005] Ford, William H. and William R, Topp. Data Structures with Java .
Upper Saddle River, NJ: Prentice Hall, 2005. See Chapter 19 and 21.
[Kruse, 1994] Kruse, Robert. Data Structures and Program Design 3rd ed .

Eaglewood Cliffs, New Jersey: Prentice Hall, 1994. See Chapter 9.
[Langsam, 2003] Langsam, Yedidya, Moshe Augenstein, and Aaron M. Tanenbaum. Data
Structures Using Java . Upper Saddle River, NJ: Prentice Hall, 2003. See Chapter 4.
[Lewis, 1982] Lewis, T.G. and M.Z. Smith. Applying Data Structures 2 nd ed. Hopell, New
Jersey: Houghton Miflin, 1982. See Chapter 8.
[Shaffer, 1997] Shaffer, Clifford A. A Practical Introduction to Data Structures and Algorithm
Analysis . Upper Saddle River, New Jersey: Prentice Hall, 1997. See Chapter 10.
[Venugopal, 2007] Venugopal, Sesh. Data Structures Outside In with Java . Upper Saddle
River, NJ: Prentice Hall, 2007. See Chapter 12.
[Weis, 2007] Weiss, Marl Allen. Data Structures and Algorithm Analysis in Java 2 nd ed.
Boston, MA: Addison-Wesley, 2007. See Chapter 5.