RoaringBitmap / RoaringBitmap/roaring
Implement and benchmark shotgun intersection
Open
Nobody has claimed this yet.
performance
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
In some cases, we should be able to greatly improve the performance of array-array intersections. See Faster intersections between sorted arrays with shotgun.
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 by reading the linked shotgun intersection article and locating the repository's array-array intersection entry point. Compare the existing implementation with the proposed approach, add a benchmark for the relevant cases, and verify that the benchmark demonstrates the intended performance improvement.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- databases, performance
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 30/100