rmuir commented on PR #11860: URL: https://github.com/apache/lucene/pull/11860#issuecomment-1302331407
> For this vector graph file, since we use the same bpv, we can easily find a node's neighbor list just by offseting using `nodeOrdinal * 32 * bpv`. It's important this is efficient because you can load 100s of neighbor lists per search. that's one way to do it, but seems like a self-created problem: you could also just encode "offset" directly which could be a zigzag delta, or use numerous other designs, that wouldn't require the same bpv everywhere. -- 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
