quickwit-oss / quickwit-oss/quickwit
Support for large start_offset
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 11.7k
- Forks
- 597
- Avg merge
- 2d 22h
- Merged PRs (30d)
- 37
Description
Outlined use case here https://github.com/quickwit-oss/quickwit/issues/1449#issuecomment-1127911151
After https://github.com/quickwit-oss/quickwit/pull/1539, the limit is 10_000. It would be good to support very large start_offsets for some scenarios, e.g. data extraction.
For very large start_offset, we can probably assume that:
- strict score sorting is not that important anymore
- the split merge algorithm should still be deterministic, to be able to scan the data
Contributor guide
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 issue #1449's linked comment and pull request #1539 to understand the current 10,000 start_offset limit and its implementation. Trace the search pagination and split-merge paths, then define how very large offsets can preserve deterministic scanning while relaxing strict score ordering; done means the behavior is implemented and covered by tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100