gsmiller commented on PR #12417: URL: https://github.com/apache/lucene/pull/12417#issuecomment-1629353957
> Hi! I have an idea. Since our encode and decode functions are fast, can we lazy compute prefix sums? We can first decompress them and only calculate the actual values when the user needs them. This might save some time. It's just a preliminary idea, and I would like to hear everyone's opinions. If everyone thinks it's a good idea, I might try implementing it and see how it works. I like the idea of trying this out, but maybe in a spin-off issue? @rmuir raised it a little while back as well (need to dig up a link to his comment). I think it may add additional complication to getting this right since the performance will start to depend a lot on how "sparse" a query is and where the matching docs fall in a block? -- 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: issues-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
