Github user aaronjosephs commented on the pull request:
https://github.com/apache/spark/pull/1381#issuecomment-55604431
@JoshRosen this isn't necessarily specified on the ticket but it's related.
Since most of the time something will be range partitioned because you called
sortByKey on it this could actually be even more efficient (if cached) on
smaller data sets if you glommed the partition and did a binary search on the
array. I'm not sure if the glomming overhead would outweigh the benefits of the
binary search, I'd like to know if you have any opinions on this
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
