mikemccand commented on PR #15903: URL: https://github.com/apache/lucene/pull/15903#issuecomment-4169959330
> One worry I have with TQ in Lucene is related to per-segment overhead at query time. The transforms can be addressed by pushing it up to the query layer, but an efficient scoring implementation would likely use lookup tables that are expensive to compute and may not have a good implementation on panama depending on how well Vector.shuffle() is implemented. Isn't it one global transform (not per segment) in this PR? Or would we want to change that to per-segment, to increase randomness/protection against unlucky rotation choice? These highly concurrent SIMD shuffle instruction (like `VPSHUFB`) implementations in silicon are wild: https://claude.ai/share/226e0cf6-0d44-4602-804d-b2449777621e -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
