jerqi commented on issue #2652: URL: https://github.com/apache/uniffle/issues/2652#issuecomment-3436124255
> > > [apache/spark#50230](https://github.com/apache/spark/pull/50230) > > > the above row based checksum looks a good design, I could follow this thought to implement in uniffle > > > > > > It's a good design. But seems that it can't solve the issue above. > > When initializing the shuffle reader, we could get the partition's checksum sum. And when reading, once iterator.next one row, we could calculate the checksum of this row and aggerate to compare with the initial checksum sum. How to caculate the reduce partition checksum? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
