data: add RAM-bounded sequential reference dedup pipeline#16
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Why
A measured 1M-document combined-index sample projected 44.1 GB LSH RSS for all 30.44M reference documents, before the additional exact-hash set, on a host with only 49 GB available. The combined index is therefore unsafe.
Pipeline
dedup_de_sequential.pyruns the existing hardened dedup implementation once per reference:fresh → ref1 → survivors → ref2 → ... → finalThe retained set is the union-of-reference rejection result; only exact/near attribution can depend on reference order.
Tests cover two-reference aggregation, stage counts, final retention, intermediate cleanup and unsafe in-place output.