RoaringBitmap / RoaringBitmap/roaring
Fine tune array-array intersection algorithm
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
When two array containers are intersected, we select the right algorithm according to a heuristic which depends (arbitrarily) on a parameter (64). This parameter was chosen more or less randomly a long time ago. It could be that either a larger or, more likely, a smaller value could be preferable in practice. We should test this out:
https://github.com/RoaringBitmap/roaring/blob/master/setutil.go#L202-L208
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
Start in setutil.go at lines 202-208, where the array-array intersection heuristic uses 64. Benchmark the alternative algorithms across representative array sizes and compare thresholds; done means the chosen parameter is supported by measurements rather than the current arbitrary value.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100