In DB2 database, Insert, Delete and Update are real operations you do very often. To access your data, you need to use Index or Hash on the Table you wish to use. I am going to give here the top differences between hash and index.
Index vs Hash scan
- To create Unique columns, you have to define an index.
- When you are updating particular column more often, you had better avoid defining an index on that column.
- You can define Index on multiple columns. The reason is to increase Uniqueness
- When the size of the table is less than 100 pages, you had better define one index.
- Adding more columns to index requires more storage. So it degrades performance.
- Always go for Index-only access. That means give Indexed columns in Where clause
- Hashing or Hash scan is faster than an index.
- Hashing is used to insert or access data.
- A hash value is generated during processing of Insert values. The same values will be used to retrieve the data.
- You can define the Hash on the primary key column of the Table.
- Hashing should be used on the Tables, where data is accessed more often using the Primary key.
- Organizing Table data for hash access is a burden on the database.
- When you define Hash space, the amount of storage you specfied is not enough, then the data will be relocated to another area. This causes performance degradation.
Hash Access Path
- You can use Hash access on Tables even-though indexes are defined.
- DB2 does not allowe Hash access for the Tables defined with Clustering index
Download Index vs Hashing Pdf
Types of Indexes in DB2 RDBMS
- Unique Index
- Non-Unique Index
- Bi-directional Index
- Clustering Index
- Non-Clustering Index
- Partitioned index
- Non-partitioned index
What is Hash Table
A Hash table in RDBMS contains addresses of all the Table data. During Hash scan, it first looks in Hash table to get the address.