quickwit-oss / quickwit-oss/quickwit
Optimization: filter + scoring by timestamp
Open
Nobody has claimed this yet.
enhancement
low-priority
- Dominant language
- Rust
- Stars
- 11.7k
- Forks
- 597
- Avg merge
- 2d 22h
- Merged PRs (30d)
- 37
Description
There are several ideas we could leverage to sort by timestamp.
When we sort AND filter a timestamp range, we end up fetching the timestamp twice.
The timestamp is often almost sorted.
A minor amount of metadata could make it possible to restrict our query.
within [t_start, t_end] implies doc in [doc_a, doc_b]
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 tracing the timestamp filtering, sorting, and scoring paths to understand where the timestamp is fetched twice. Investigate whether metadata can establish that a timestamp range maps to a document range, then define measurements or tests showing the optimization is correct and improves queries.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- performance, search
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100