[DOC] Support billion-scale CAGRA build with conversion to HNSW
Nobody has claimed this yet.
- Dominant language
- Cuda
- Stars
- 854
- Forks
- 236
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 62
Description
While we have methods to scale CAGRA itself to the billion-scale, we run into some challenges when we build a CAGRA graph (specifically out of core) and convert it to an HNSW graph because the CAGRA graph itself does not fit into host memory.
It's challenging to solve this because the graph optimization step assumes fast random access, which doesn't promote efficient use of disk. We're looking for better ways to break apart the optimization algorithm and/or batch the graph construction so that we can support datasets that surpass the amount of available host memory.
This will enable "dynamic indexing" use-cases where users need to build gigantic graphs that can be immediately consistent/fresh and can't afford to use sharding.
cc'ing @tfeher who's been working on solutions tot his.
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
The issue names no files or tests. Start by locating the out-of-core CAGRA build and the CAGRA-to-HNSW conversion path, then determine how graph optimization accesses host memory. Done means supporting billion-scale conversion when the CAGRA graph does not fit in host memory.
Written by the indexing model from the issue text.
Assessment
- Domain
- performance, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100