Dynamic GUS encodes LSH bucket memberships as sparse embeddings and uses ScaNN to retrieve graph-neighbor candidates in milliseconds, largely preserving Grale's graph quality.
https://github.com/facebookresearch/pysparnn,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality
Dynamic GUS encodes LSH bucket memberships as sparse embeddings and uses ScaNN to retrieve graph-neighbor candidates in milliseconds, largely preserving Grale's graph quality.