[CI] TestCuVSAcceleratedHNSWGaps.testVectorSearchWithAlternatingDocuments is flaky
Nobody has claimed this yet.
- Dominant language
- Cuda
- Stars
- 854
- Forks
- 236
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 62
Description
calculateExpectedTopK computes the exact Euclidean top-k and the test asserts that every result returned by the HNSW search must appear in that set:
assertTrue("Result " + id + " should be in expected top-k results", expectedIds.contains(id));
Since Lucene99AcceleratedHNSWVectorsFormat uses an approximate nearest-neighbor algorithm (CAGRA-built HNSW graph), it is not guaranteed to return the exact top-k. The assertion fails for legitimately correct approximate results.
Reproduced with:
-Dtests.seed=FFE4A5B93F63EAEF -Dtests.locale=fr-BE -Dtests.timezone=SystemV/PST8PDT
Failure:
Result 858 should be in expected top-k results
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with TestCuVSAcceleratedHNSWGaps.testVectorSearchWithAlternatingDocuments and its calculateExpectedTopK helper. Reproduce the failure with the supplied tests.seed, locale, and timezone, then verify the assertion reflects approximate HNSW results rather than requiring exact top-k membership. Done means the test remains meaningful and passes for legitimate approximate results.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- search, testing-qa
- Issue type
- Bug
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Active
- Clarity
- Mostly clear
- Newbie friendliness
- 72/100