What is the difference between partitioning with key and
round robin?
Answers were Sorted based on User's Feedback
Answer / pradeep
1)Partition by key needs a key where round robin doesnot need
2)Round Robin always tries to distribute the records
equally.where partition by key not.
| Is This Answer Correct ? | 21 Yes | 2 No |
Answer / shashank
Partitioning by key distributes the data into various
multifile partitions depending upon of the fields present in
the input(key), while Partitioning by round robin distribues
data equally among the partitions irrespective of the key
field. Round robin ensures equitable distribution of data
among the partitions, while By key may lead to inequitable
distribution.
| Is This Answer Correct ? | 13 Yes | 0 No |
Answer / guest
in patitioning with key the partitioning is based on key
whereas round robin is not based on key
| Is This Answer Correct ? | 6 Yes | 1 No |
Answer / nag
Partition by key distributes the data records accroding to
the specified key.
Partition by round robin distributes blocks of data records
evenly in round and robin fashion
| Is This Answer Correct ? | 5 Yes | 0 No |
Answer / supriya
Partition by key distributes the data records accroding to
the specified key.
Partition by round robin distributes blocks of data records
based on block size (parameter) in round robin fashion
| Is This Answer Correct ? | 5 Yes | 0 No |
Answer / suresh
partition by key distributes data records to its out put flow partitions according to key values
where as partition by round robin distributes data records to its out put flow partitions based on block size in round robin fashion
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / shiba
- In PBK, partition of data are done according one specific key. But in PBRR, partition is done according the block size.
- In PBK, data flows to the output randomly, but in PBRR, data flows to output in orderly format.
| Is This Answer Correct ? | 0 Yes | 0 No |
How does PBK and Sort component and Join(in memory sort) work?I mean in the join component i have used In Memory Sort,so how will it work in terms of performence as compared with PBKand Sort Component?
what are the steps in actual ab initio graph processing including general,pre and post process settings?
What is air_project_parameters and air_sandbox_overrides? what is the relation between them?
Please some body send me Ab Initio material in my mail ... sitakanta2009@gmail.com Thanks in Advance!!!
How to add default rules in transformer?
Pdl with an example?
What is the difference between In-Memory Sort and Inputs must be sorted?
How will you use EME for view or publish metadata reports using EME?
what are kinds of layouts does ab initio supports ?
what is macro?At what situation we have to face?
Whenever we load data into oracle table from staging table using exchange partition...then I read somewhere that data actually doesn't move in this and this command only reset the pointer in the data dictionary...so if data doesn't move then how data is loaded into the main table ? I mean wat is the point of pointer update in data dictionary?
What are the different types of parallelism used in abinitio?