Why is hash file is faster than sequential file n odbc stage??

Questions by yukthi   answers by yukthi

Showing Answers 1 - 6 of 6 Answers

Lavanya

  • Nov 8th, 2006
 

Hash file is indexed. Also it works under hashing algo. That's why the search is faster in hash file.

  Was this answer useful?  Yes

aladap12

  • Jun 28th, 2009
 

Hash file is datastage internal file. Data will be stored on computer memory..
and works on key column. So retrieval will be faster when compare to hitting the database.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions