RoaringBitmap / RoaringBitmap/roaring
ParOr: be smarter in determining the result container
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 2.9k
- Forks
- 262
- Avg merge
- 2h 34m
- Merged PRs (30d)
- 8
Description
ParOr considers all containers at key k in a single loop. Currently when orFunc is called we instantly create a bitmap container.
We could, instead, try computing the sum of cardinalities for all containers at k and if its less than 4096 use an array container as the result.
This issue is also related to #106. This improvement idea would only make sense when *arrayContainer.iorArray() would be smart about converting or not converting to a bitmap container internally.
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 ParOr loop and the orFunc path, then inspect how arrayContainer.iorArray() handles conversion. Implement the cardinality check for containers at key k, preserving the 4096 threshold, and verify that the result uses an array container when appropriate without premature bitmap conversion.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- data, performance
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100