benwtrent commented on issue #15904:
URL: https://github.com/apache/lucene/issues/15904#issuecomment-4172040961
@msokolov yeah, I am not sure. Flush could still be incremental and on-heap.
Merge is the real heap cost (way larger graphs and way more expensive), I
think this searching all the segment graphs approach during merge has many
other benefits:
- Removing backlink locking, now parallelism is naive
- For asymmetric scoring, we no longer need to write temporary query
vectors as we only ever score "query side" with a vector once
- May allow us to move HNSW graph building off heap (each layer gets a
temporary file that is just appended to)
--
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]
