Input Data:
AAABBBCC
CCAAABB
expected output
A3B3C2
A3B2C2
How can I achieve this in Ab initio?
where In output count of occurrences should be sorted from high to low
No Answer is Posted For this Question
Be the First to Post Answer
Mention what dedup-component and replicate component does?
Can sorting and storing be done through single software or you need different for these approaches?
Is there any function in ab Initio which act like SCAN component
Can any body give the PDL with example?
what is different daily and monthly develop the abinitio graphs?
What is regex (lookup)? When you should use it? How to use in abinitio graph?
What exactly do you understand with the term data processing and businesses can trust this approach?
What happens when we provide null key to sort, merge and pbks in Abinitio ?
How to create repository in abinitio for stand alone system(local nt)?
Where $mpjret is used in ab-initio?
what is the difference between ab_work_dir and .work
If I delete 1 partition (in 8 partition multifile) and run the graph. Will the graph run successfully?, If not what error I'm going to get.