feat: support hamming clustering#7379
Merged
jackye1995 merged 1 commit intoJun 19, 2026
Merged
Conversation
github-actions
Bot
added
A-python
Add SIMD-accelerated pairwise hamming distance over 64-bit binary hashes, plus union-find clustering to group binary vectors within a hamming-distance threshold (near-duplicate detection). - lance-linalg: pairwise_hamming_distance[_parallel] with AVX-512 / AVX2 / scalar kernels, PairwiseResult, UnionFind, Cluster/ClusteringResult, extract_hashes_from_fixed_list, cluster_edges/cluster_pairwise_result. - lance: hamming_clustering_for_ivf_partition / for_sample / for_range / from_hashes and get_ivf_partition_info, returning a RecordBatchReader of (representative, duplicates) clusters. - python: thin bindings + wrappers in lance.vector, type stubs, and a test. Recreates lance-format#6265 (originally authored by Jack Ye) on top of current main, updating imports/signatures for upstream API drift. Co-Authored-By: Jack Ye <yezhaoqin@gmail.com>
brendanclement
force-pushed
the
feat/hamming-clustering
branch
from
415f70a to
ec02d9a
Compare
jackye1995
approved these changes
Jun 19, 2026
Codecov Report❌ Patch coverage is
📢 Thoughts on this report? Let us know! |
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
2 participants
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.
Add SIMD-accelerated pairwise hamming distance over 64-bit binary hashes, plus union-find clustering to group binary vectors within a hamming-distance threshold (near-duplicate detection).
Recreates #6265 (originally authored by Jack Ye) on top of current main, updating imports/signatures for upstream API drift.