[SOLR-10057] Evaluate/Design a MatchMost/MatchAll doc set - ASF JIRA

Agile Board

Attach files

Attach Screenshot

Add vote

Voters

Watch issue

Watchers

Create sub-task

Link

Clone

Update Comment Author

Replace String in Comment

Update Comment Visibility

Delete Comments

XML

Word

Printable

JSON

Details

Type: New Feature
Status: Open
Priority: Major
Resolution: Unresolved
Affects Version/s: None
Fix Version/s: None
Component/s: None
Labels:
None

Description

Per discussion in ~~SOLR-9764~~ Design a memory efficient DocSet if a query returns all docs, if a DocSet matches most of documents, current implementation using BitDocSet can be optimized. This JIRA is to evaluate and design an optimized DocSet for these use cases.

The basic idea is to use an inverted integer list to enumerate all doc ids that doesn't match. If the DocSet matches most of docs, it can be pretty efficient. Meanwhile other ideas are welcome.