quickwit-oss / quickwit-oss/quickwit
Explore implementing bloom filters for pruning tagged fields with high cardinality.
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 11.7k
- Forks
- 597
- Avg merge
- 2d 22h
- Merged PRs (30d)
- 37
Description
Currently, we support tagging splits with field values, letting us prune splits based on a given query without having to download the split itself.
The limitation currently, however, is we have a maximum cardinality of 1000 entries which can be quite limiting in situations where you have a higher cardinality but still want to make use of pruning.
A possible solution is to use a bloom filter of some variety which allows for higher cardinality at the expense of having the potential for false positives when pruning.
Further discussion is needed.
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
The issue names no files, tests, or entry points, so begin by locating the existing tagged-field cardinality limit and split-pruning implementation. Discuss the bloom-filter design and trade-offs with maintainers first; the issue does not yet define acceptance criteria or what done looks like.
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
- Needs clarification
- Newbie friendliness
- 25/100