rajat315315 commented on PR #16320: URL: https://github.com/apache/lucene/pull/16320#issuecomment-4882102773
### Benchmark Results I ran `luceneutil`'s `KnnGraphTester` to measure the impact of the `NeighborArray.sort()` optimization. The benchmark was executed on the SIFT1M dataset (128 dimensions) using the Java Vector API. **Test Parameters:** * `maxDoc`: 1,000,000 * `maxConn`: 16 * `beamWidthIndex`: 100 * `numQueries`: 10,000 **Hardware/Environment:** * JDK Vector Incubator: Enabled (`preferredBitSize=256; FMA enabled`) | Metric | `main` (Baseline) | PR Branch | Difference | | :--- | :--- | :--- | :--- | | **Index Time (CPU)** | 177.03s | 172.71s | **-2.4%** | | **Index Time (Merge Wait)** | 91.72s | 81.34s | **-11.3%** | | **Search Time (1k queries)** | 1,832 ms | 1,660 ms | **-9.3%** | | **Search QPS** | 545 | 602 | **+10.4%** | **Conclusion:** Replacing the $O(N^2)$ insertion sort yields a measurable reduction in graph construction time and background merge overhead. We also see a ~10% throughput increase during the search phase. -- 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]
