Skip to content
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

Closed
devin-petersohn opened this issue Oct 17, 2016 · 5 comments
Closed

Maintaining sorted/partitioned knowledge #1216

devin-petersohn opened this issue Oct 17, 2016 · 5 comments
Assignees
Milestone

Comments

@devin-petersohn
Copy link
Member

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.

@heuermh
Copy link
Member

heuermh commented Oct 17, 2016

See also #188

@devin-petersohn
Copy link
Member Author

@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

@jpdna
Copy link
Member

jpdna commented Oct 24, 2016

@devin-petersohn - just want to make sure you have seen this thread: #651

@jpdna
Copy link
Member

jpdna commented Oct 24, 2016

@devin-petersohn
Copy link
Member Author

Resolved with #1324.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants