Static hashing methods stored items in the table and its key code to establish a definite correspondence between

the function to each key code and the structure of a single storage location corresponding to: In the search, the first key item on the table code for function calculation, the function value is stored as a table entry in the structure of entries. he word, 'static' means that something stays still, so by this definition static hashing is the method by which items that are stored in a table, or directory, are fixed. Once these primary pages are full, an overflow bucket is necessary in order to store any additional records, but this must hash to the original bucket (the place where the original records are kept). This can be achieved by using a link to the overflow page, or by using a linked list of the overflow pages. In the search, the first item that has been saved is the key item and becomes the function value. This is stored as a table code for function calculation. When searching for items, if the key codes are the same then a successful search can be made, either in the original pages or in the overflow buckets. The original bucket is searched initially for a record, and then the overflow buckets are searched; if there are many keys that hash to the same bucket, finding what you require will take longer because many pages will be accessed before you find your record. This time consuming search method has been solved by using dynamic hashing. Dynamic hashing means that the directory will become bigger in conjunction with the number of collisions, so that new records can be accommodated. This also means that long overflow page chains can be avoided. Linear hashing and extendible hashing are two examples of dynamic hashing techniques. Distinguish between static hashing and dynamic hashing? Static hashing Static hashing uses a hash function in which the set of bucket adders is fixed. Such hash functions cannot easily accommodate databases that grow larger over time. Dynamic hashing Dynamic hashing allows us to modify the hash function dynamically. Dynamic hashing copes with changes in database size by splitting and coalescing buckets as the database grows and shrinks.