-
Notifications
You must be signed in to change notification settings - Fork 308
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Maintaining sorted/partitioned knowledge #1216
Comments
See also #188 |
@fnothaft Following up from our conversation this morning, the mix-in implementation is finally debugged. I am going to move toward working on splitting partition and sort. Here is the working repo for those interested: https://github.com/devin-petersohn/adam/tree/partitioner |
@devin-petersohn - just want to make sure you have seen this thread: #651 |
It may be useful to look at: |
Resolved with #1324. |
It would be beneficial if we had a way to know that a given file was sorted when it was written. As is, RDDs are force-sorted and partitioned before operations that require sorted RDDs.
Implementing Issue #1175 is a part of this work.
The text was updated successfully, but these errors were encountered: