Revolutionizing Data Management: A Deep Dive into Hashed Internal Tables and Beyond
Welcome back everyone, I hope you all will be fine. So basically in our last blog we were discussing about types of internal table. So let’s continue it. Hashed Internal Tables :- They are the special type of internal table which works on HASH algorithms. We need to specify the unique key while declaring the internal table. Hashing :- It is a technique which directly returns the address of the record based upon the search key without using the index. Suppose we have 5 order numbers and we have specified order number 10 as unique key, So in this case Hashing will directly map or point to the address of the order number 10. They are not the index based internal table. Records can be inserted. Data already sorted, there is no need to use SORT statement. Key operation is used to search a record, there is no index search. Hashed algorithm is used to search a record. Response time is faster as compared to Standard and sorted internal tables, as response time i