Title: Implementation of Linear Hashing as Utility
Date/Time: January 9th, 2017 @ 4:00 PM
Place: 223 Atanasoff
Major Professor: Shashi Gadia
Committee Members: Ying Cai, Phillip H Jones
Linear Hashing is a hash table algorithm that is useful in storing data on secondary storage. Here we have implemented the algorithm such that the address space may grow or shrink dynamically. Thus a linearly hashed file supports insertions and deletions of records without much of an over head. Data is stored on disk and retrieval of information from a disk takes one page access. If the information is larger than a page, then the minimum cost is the number of pages occupied by the information. This is an ideal goal and it is not always possible to meet this cost without some additional hidden costs. Linear hashing is a technique that comes close to achieving the ideal goal. The entire implementation is in the form of a utility which makes efficient distribution of labor between user and the system.