What is the difference between hashed file stage and sequential file stage in relates to DataStage Server?

  • Interview Candidate
  • 3
  • 5913

Showing Answers 1 - 3 of 3 Answers

Beena

  • Oct 23rd, 2005
 

In datastage server jobs,can we use sequential filestage for a lookup instead of hashed filestage.If yes ,then whats the advantage of a Hashed File stage over sequential filestage

search is faster in hash files as you can directly get the address of record directly by hash algorithm as records are stored like that but in case of sequential file u must compare all the records.

  Was this answer useful?  Yes

sangroover

  • Feb 14th, 2006
 

Hash file is helpful to take data from any coloumn, it will also have a key, as it has the key the data is sorted.

wHEN

  Was this answer useful?  Yes

SRIKANTH

  • Sep 4th, 2006
 

SEQUENTIAL FILE CANT BE USED AS LOOK UP.. || HASHED FILE CAN BE USER AS LOOK UPIN SEQ.FILE REMOVING DUPLICATES IS DIFFICULT ||IT MAINLY WORKS AS HASHING ALGORITHM WITH OUT ANY KEY COLUMN IT WONT COSIDER..HASHED FILE IS UR FOR BETTER PERFORMANCE..WE INCREASE THE SIZE OF THE BUFFER IN TIS..

  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