Can we use refex-rolx on large graphs?
Open
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 3
- Forks
- 2
- PR merge metrics
- No merged PRs in 30d
Description
We have a billion node business graph and are interested in trying refex-rolx for node discovery. We could partition our graph, but need to understand how well this algorithm scales on large networks.
Contributor guide
No contributing guide indexed for this repository
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
No files, tests, or entry points are named in the issue. First clarify the supported graph size and the expected scalability evidence, then identify the implementation and benchmarking entry points; done would be a documented scalability result or a scoped change proposal.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100