RoaringBitmap / RoaringBitmap/roaring-rs
Optimization: investigate faster search in array
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 957
- Forks
- 119
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 1
Description
Some ideas for improving the binary search for array stores:
https://dirtyhandscoding.wordpress.com/2017/08/25/performance-comparison-linear-search-vs-binary-search/
IMO the two should be combined - binary search should be used to narrow down the range to the point where linear search is faster, then continue with that.
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 file or test is named; start by locating the binary-search implementation for array stores and review the linked performance comparison. Measure the current search behavior before evaluating the proposed hybrid approach, and consider the work done only when the chosen strategy is supported by benchmarks and tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 38/100