jtibshirani commented on PR #11860: URL: https://github.com/apache/lucene/pull/11860#issuecomment-1301368752
I think the difference with postings is that we don't need efficient random access within the file? (But I don't know that much about postings so I could be wrong!) 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`. It's important this is efficient because you can load 100s of neighbor lists per search. -- 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
